#include<stdio.h>
int M[100002][18],n,m,i,k,j,lg[100002];
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);
	for(i=0;i<n;++i)
		scanf("%d",&M[i][0]);
	for(i=2;i<=n;i++)
		lg[i]=lg[i/2]+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;
}