#include<stdio.h>
int lg[100005],v[100005][20],n,v,i,k,l,j,x,y;
int vain()
{
	freopen("rvq.in","r",stdin);
	freopen("rvq.out","w",stdout);
	scanf("%d %d",&n,&v);
	scanf("%d",&v[1][0]);
	for(i=2;i<=n;++i)
	{	
		scanf("%d",&v[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(v[i][j-1]<v[i+(1<<(j-1))][j-1])
				v[i][j]=v[i][j-1];
			else v[i][j]=v[i+(1<<(j-1))][j-1];
	for(i=1;i<=v;i++)
	{
		scanf("%d %d",&x,&y);
		l=y-x+1;
		k=lg[l];
		if(v[x][k]<v[y+1-(1<<k)][k])
			printf("%d\n",v[x][k]);
		else printf("%d\n",v[y+1-(1<<k)][k]);
	}
	return 0;
}