#include <bits/stdc++.h>

using namespace std;

int n, m, x, y, rmq[18][1 << 18];

void build(){
	int sz = log2(n) + 1;
	for(int i = 1; i <= sz; i++)
		for(int j = 0; j < n; j++)
			rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}

int solve(int x, int y){
	x--; y--;
	int dist = y - x + 1;
	int sz = log2(dist);
	return min(rmq[sz][x], rmq[sz][x + dist - (1 << sz)]);
}

int main(){
	ifstream in("rmq.in");
	ofstream out("rmq.out");
	in >> n >> m;
	for(int i = 1; i <= n; i++)
		in >> rmq[0][i-1];
	build();
	for(int i = 1; i <= m; i++){
		in >> x >> y;
		out << solve(x, y) << '\n';
	}		
	return 0;
}