#include <stdio.h>
#include <stdlib.h>
#include <time.h>

#define MAXN 100002
#define MAXLOGN 17

int M[MAXN][MAXLOGN],N,NQ,LG[MAXN];

int min(int x,int y) {return (x<y)?x:y;}

int main() {

	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	
	scanf("%d%d",&N,&NQ);
	
	int i,j,x,y,k,l,res;
	
	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;(1<<j)<=N;++j)
		for (i=0;i+(1<<j)-1<N;++i)
			M[i][j] = min(M[i][j-1],M[i+(1<<(j-1))][j-1]);

	for (i=0;i<NQ;++i) {
		scanf("%d%d",&x,&y);
		k = LG[y-x+1];
		l = y-(1<<k);
		res = (M[x-1][k]<M[l][k])?M[x-1][k]:M[l][k];
		printf("%d\n",res);
	}
	
	fclose(stdin);
	fclose(stdout);
	return 0;
}