#include <cstdio>
const int N = 100005;
int n, m, a[20][N], P[20];
inline int min(int a,int b){
	return a<b?(a):(b);
}
int main() {
	freopen("rmq.in", "r", stdin);
	freopen("rmq.out", "w", stdout);

	int p, i, j, k, X, Y;
	int x[N], l[N];

	scanf("%d %d ", &n, &m);
 	
	for(i = 1; i <= n; ++i)
		scanf("%d", &x[i]);

	p = 1;
	k = -1;
		for(i = 1; i<= n; ++i) {
			if( i == p )
				++k, p*=2;
			
			if( i <= p ) 
				l[i] = k ;
			
		}
	P[0] = 1;
		for(i = 1; i <= 18; ++i)
			P[i] = P[i - 1] * 2;

		for(i = 1; i <= n; ++i)
			a[0][i] = x[i];

		for(i = 1; i <= l[n]; ++i)
			for(j = 1; j <= n; ++j)
				if( j + P[i] <= n + 1 )
					a[i][j] = min(a[i - 1][j], a[i - 1][j + P[i-1]]);

		for(; m; --m) {
			scanf("%d %d", &i, &j);
			printf("%d \n", min(a[l[j - i + 1]][i], a[l[j - i + 1]][j - P[l[j - i + 1] ] +1] ) );
		}	
	return 0;
}