/* a[i][j]=min(v[i],v[i+1].....v[i+2^j-1])

a[i][0]=v[i]
a[i][j]=min(a[i][j-1],a[i+2^(j-1)][j-1]) pt j>1

min([x,y])=min(a[x][L],a[y-2^L+1][L])

L=[log(y-x+1)]
*/
#include <stdio.h>
#define N 100017  
int n,m,v[N],a[N][17],log[N];
inline int min(int x,int y){
	if(x>y) return y;
	return x;
}
void logaritm(){
	int x=1,i;
	for(i=1;i<=n;i++)   
		if((1<<x)>i)
			log[i]=x-1;
		else log[i]=x++;
}   

void matrice(){
	int i,j;
	for(i=n;i>=1;i--){
		a[i][0]=v[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,x,y,l,sol;
	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]);
	matrice();
	logaritm();
	for(i=1;i<=m;i++){
		scanf("%d%d",&x,&y);
		l=log[y-x+1];
		sol=min(a[x][l],a[y-(1<<l)+1][l]);
		printf("%d\n",sol);
	}
	return 0;
}