#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int k,n,m,d,x,y,i,j,l[100001],a[20][100002];
int main()
{f>>n>>m;
for(i=1;i<=n;++i)
	f>>a[0][i];
for(i=1;(1<<i)<=n;++i)
	for(j=1;j<=n-(1<<i)+1;++j)
		a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
for(i=2;i<=n;++i)
	l[i]=l[i/2]+1;
for(i=1;i<=m;++i)
{f>>x>>y;
d=y-x+1;
k=min(a[l[d]][x],a[l[d]][x+d-(1<<l[d])]);
g<<k<<'\n';
}
f.close();
g.close();
return 0;
}