#include<stdio.h>
#define min(a,b) a<b?a:b
#define NMAX 100005
int M[NMAX][18],n,m,i,k,j,lg[NMAX];
int main()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	scanf("%d %d",&n,&m);
	for(i=0;i<n;++i)
	{	
		scanf("%d",&M[i][0]);
		if(i)lg[i+1]=lg[(i+1)>>1]+1;
	}
	for(j=1;j<=lg[n];++j)
		for(i=0;j<=lg[n-i];++i)
			M[i][j]=min(M[i][j-1],M[i+(1<<(j-1))][j-1]);
	for(i=0;i<m;i++)
	{
		scanf("%d %d",&n,&j);
		k=lg[j-n+1];
		if(M[n-1][k]<M[j-(1<<k)][k])
		printf("%d\n",M[n-1][k]);
		else printf("%d\n",M[j-(1<<k)][k]);
	}
	return 0;
}
/*#include<stdio.h>
#define min(a,b) a<b?a:b
int lg[100005],v[20][100005],n,m,i,ll,l,j,x,y;
int main()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	scanf("%d %d",&n,&m);
	for(i=1;i<=n;i++)
		scanf("%d",&v[0][i]);
	for(i=2;i<=n;i++)
		lg[i]=lg[i/2]+1;
	for(i=1;i<=lg[n];i++)
		for(j=1;i<=lg[n+1-j];j++)
			v[i][j]=min(v[i-1][j],v[i-1][j+(1<<(i-1))]);
	for(i=1;i<=m;i++)
	{
		scanf("%d %d",&x,&y);
		ll=lg[y-x+1];
		printf( "%d\n",min( v[ll][x],v[ll][y+1-(1<<ll)] ) );
	}
	return 0;
}*/