#include<fstream>
#include<algorithm>
using namespace std;

int i,j,n,m,k,r,lm,a[100010][22],x,y,s[100010],b[100010];
int main()
{
	FILE *f=fopen("rmq.in","r");
	FILE *g=fopen("rmq.out","w");
	fscanf(f,"%d%d",&n,&m);
	b[1]=0;
	for(i=1;i<=n;++i)
	{
		fscanf(f,"%d",&x);
		a[i][0]=x;
		if(i>1)
		b[i]=b[i/2]+1;
	}
	for(i=1;(1<<i)<=n;++i)
	{
		lm=n-(1<<i)+1;
		k=1<<(i-1);
		for(j=1;j<=lm;++j)
		a[j][i]=min(a[j][i-1],a[j+k][i-1]);
	}
	for(i=1;i<=m;++i)
	{
		fscanf(f,"%d%d",&x,&y);
		k=b[y-x+1];
		lm=(y-x+1)-(1<<k);
		fprintf(g,"%d\n",min(a[x][k],a[x+lm][k]));
	}
	return 0;
}