using namespace std;
#include <cstdio>
#include <algorithm>

int n, m, i, j, l, x, y, p;
int lg[100010], a[100010][32];

int main(){

	FILE *f = fopen("rmq.in", "r");
	FILE *g = fopen("rmq.out", "w");

	fscanf(f,"%d %d",&n, &m);
	for(i = 1; i <= n; i++)
		fscanf(f,"%d",&a[i][0]);
	
	for(j = 1; (1 << j) <= n; j++){	
		l = 1 << j;
		for(i = 1; i <= n && i + l - 1 <= n; i++)
			a[i][j] = min(a[i][ j - 1 ], a[ i + (l >> 1) ][j - 1]);
		
	}
	
	p = 1;
	lg[0] = 0; j = 2;
	for(i = 1; i <= 100001; i++){
		lg[i] = lg[i-1];
		if(i == j){
			lg[i] = p;
			j = j << 1;
			p++;
		}
	}
	
	for(i = 1; i <= m; i++){
		fscanf(f,"%d %d", &x, &y);
		fprintf(g,"%d\n", min( a[x][ lg[y - x] ], a[ y - ( 1 << lg[y - x]) + 1 ][lg[y - x]]));
	}
	
	fclose(f);
	fclose(g);
	
	return 0;

}