#include <stdio.h>
#define N 100003
int v[N],a[N][17],lg[N],n,m;
inline int min(int x,int y){
	if(x<y) return x;
	return y;
}
void log(){
	int i,x=0;
	for(i=0;i<=n;i++)
		if( (1<<x)>i)
			lg[i]=x-1;
		else lg[i]=x++;
}
void rmq(){
	int i,j;
	for(i=n;i>=1;i--)
		for(j=1;i+(1<<j)<=n+1;j++)
			a[i][j]=min( a[i][j-1] , a[i+(1<<(j-1))][j-1]);
}
int main(){
	int i,l,x,y;
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++){
		scanf("%d",&v[i]);
		a[i][0]=v[i];
	}
	rmq();log();
	for(i=1;i<=m;i++){
		scanf("%d%d",&x,&y);
		l=lg[y-x+1];
		printf("%d\n",min( a[x][l], a[y-(1<<l)+1][l]));
	}
	return 0;
}