// infoarena: problema/rmq //

#include <fstream>
#include <algorithm>
#include <cmath>
#define MAXN 100010
#define MAXM 1000010
using namespace std;

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

int rmq[MAXN][14],i,j,n,m,x[MAXN],a,b,k;

int main()
{
	in>>n>>m;
	
	for(i=1; i<=n; i++)
		in>>x[i], rmq[i][0]=i;
	
	for(j=1; (1<<j) <= n; j++)
		for(i=1; i + (1<<j)-1<= n; i++)
			if(x[rmq[i][j-1]] < x[rmq[i + (1<<(j-1))][j-1]])
				rmq[i][j] = rmq[i][j-1];
			else
				rmq[i][j] = rmq[i+(1<<(j-1))][j-1];
	
	for(i=1; i<=m; i++)
	{
		in>>a>>b;
		k = floor(log2(b-a+1));
		out << min(x[rmq[a][k]], x[rmq[b - (1<<k) + 1][k]]) << '\n';
	}
	
	return 0;
}