#include<stdio.h>
int M[100002][18],n,m,i,k,x,y,j,lg[100002];
int main()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	scanf("%d %d",&n,&m);
	scanf("%d",&M[1][0]);
	for(i=2;i<=n;++i)
	{	
		scanf("%d",&M[i][0]);
		lg[i]=lg[i/2]+1;
	}
	for(j=1;j<=lg[n];j++)
		for(i=1;j<=lg[n+1-i];i++)
			if(M[i][j-1]<M[i+(1<<(j-1))][j-1])
				M[i][j]=M[i][j-1];
			else M[i][j]=M[i+(1<<(j-1))][j-1];
	for(i=1;i<=m;i++)
	{
		scanf("%d %d",&x,&y);
		k=lg[y-x+1];
		if(M[x][k]<M[y-(1<<k)+1][k])
			printf("%d\n",M[x][k]);
		else printf("%d\n",M[y-(1<<k)+1][k]);
	}
	return 0;
}