#include <fstream>
#include <vector>

using namespace std;

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

int rmq[100001][1000],n,m;
vector<int>v;

int main()
{
	in >> n >> m;
	v.resize(n+1);
	for (int i = 1; i <= n; i++) {
		in >> v[i];
		rmq[i][0] = v[i];
	}
	for (int j = 1; (1 << j) <= n; j++) {
		for (int i = 1; i + (1 << j) - 1 <= n; i++) {
			rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
		}
	}
	for (int i = 1; i <= m; i++) {
		int x, y;
		in >> x >> y;
		int k = 0;
		while ((1 << (k + 1)) <= y - x + 1) {
			k++;
		}
		out << min(rmq[x][k], rmq[y - (1 << k) + 1][k]) << "\n";
	}
    return 0;
}