#include <fstream>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n, m, x, y, d, l;
int rmq[100005][20];

int lg[100005];

int main()
{
    fin >> n >> m;
    lg[1] = 0;
	for(int i=2; i<=n; i++)
		lg[i] = lg[i/2] + 1;
    for(int i=1; i<=n; i++)
        fin >> rmq[i][0];
    for(int i=1; (1<<i)<=n; i++)
        for(int j = 1; j+(1<<(i-1))<=n; j++)
            rmq[j][i] = min(rmq[j][i-1], rmq[j+(1<<(i-1))][i-1]);
    for(int i=1; i<=m; i++){
        fin >> x >> y;
        d = x - y + 1;
        l = lg[d];
        fout << min(rmq[x][l], rmq[y -(1<<l)+1][l]) << '\n';
    }
    return 0;
}