#include<stdio.h>
int v[100005],M[100005][18],n,m,i,x,y,j,lg[100005];
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",&v[i]);
		M[i][0]=v[i];
		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++)
			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=0;i<m;i++)
	{
		scanf("%d %d",&x,&y);
		x--;
		y--;
		int 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;
}