#include<fstream>
using namespace std;

int d[100001][18],a[100001],v[100001],w[100001],i,j,n,m,x,y,z;

int main()
{
	ifstream f("rmq.in");
	ofstream g("rmq.out");
	f >> n >> m;
	for (i=1;i<=n;i++)
		f >> a[i];
	v[1]=0;w[1]=1;
	for (i=2;i<=n;i++)
		if (i==w[i-1]*2)
		{
			v[i]=v[i-1]+1;
			w[i]=w[i-1]*2;
		}
		else 
		{
			v[i]=v[i-1];
			w[i]=w[i-1];
		}
	for (i=1;i<=n;i++)
		d[i][0]=a[i];
	for (j=1;1 << j<=n;j++)
		for (i=1;i+(1 << j)-1<=n;i++)
			d[i][j]=min(d[i][j-1],d[i+(1 << (j-1))][j-1]);
	for (i=1;i<=m;i++)
	{
		f >> x >> y;
		z=y-x+1;
		g << min(d[x][v[z]],d[y-w[z]+1][v[z]]) << "\n";
	}
	return 0;
}