#include <bits/stdc++.h>

using namespace std;

ifstream in("rmq.in");
ofstream out("rmq.out");

int n, m, rmq[22][100200], l, r;

int main(){
	in >> n >> m;
	for(int i = 1; i <= n; i++)
		in >> rmq[0][i];
	int sz = log2(n);
	for(int pw = 1; pw <= sz; pw++)
		for(int j = 1; j <= n; j++)
			rmq[pw][j] = min(rmq[pw - 1][j], rmq[pw - 1][j + (1 << (pw - 1))]);
	while(m--){
		in >> l >> r;
		sz = log2(r - l + 1);
		out << min(rmq[sz][l], rmq[sz][r - (1 << sz) + 1]) << '\n';
	}
	return 0;
}