#include<iostream>
#include<fstream>
using namespace std;

const int N = 100002;

int n,m,x[N],rmq[20][N],lg[21];

int main() {
	int i,a,b,dist,l,j;
	
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	
	scanf("%d %d",&n,&m);
	
	for(i=1;i<=n;++i)
		scanf("%d ",&x[i]);
	
	lg[1]=0;
	for (i=2;i<=n;i++)
		lg[i]=lg[i/2]+1;
	
	for(i=1;i<=n;++i)
		rmq[0][i]=x[i];
	
	for (i=1; (1 << i) <=n;i++)
		for (j=1;j <= n - (1 << i) + 1;j++){
			
			l=1<<(i-1);
			rmq[i][j] = min( rmq[i-1][j] , rmq[i - 1][j + l] );
		}
	
	for(i=1;i<=m;++i) {
		scanf("%ld %ld",&a,&b);
		
		dist=b-a+1;
		l=lg[dist];
		
		printf("%ld\n",min(rmq[l][a],rmq[l][a+ dist - (1<<l)]) );
	}
	
	return 0;
}