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