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