#include<fstream>
#include<algorithm>
#define nmax 250005
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,a[20][nmax],power[nmax];
int main()
{
	f>>n>>m;
	int i,j,k,x,y,dif,minim;
	for(i=2;i<=n;i++)
		power[i]=power[i/2]+1;
	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++)
		{
			k=1<<(i-1);
			a[i][j]=min(a[i-1][j],a[i-1][j+k]);
		}
	while(m--)
	{
		f>>x>>y;
		minim=100005;
		dif=y-x+1;
		while(dif)
		{
			i=power[dif];
			minim=min(minim,a[i][x]);
			x+=1<<i;
			dif=y-x+1;
		}
		g<<minim<<'\n';
	}
	f.close();
	g.close();
	return 0;
}