#include <fstream>

using namespace std;

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

const int MAXN = 1e5;
const int MAXM = 1e6;
const int MAX2 = 18;

int n, m;
int dp[MAX2 + 1][MAXN + 1];
int p[MAXN + 1];

int main() {
	in >> n >> m;

	p[0] = -1;
	for (int i = 1; i <= n; ++ i) {
		in >> dp[0][i];
		p[i] = p[i >> 1] + 1;
	}

	for (int i = 1; (1 << i) <= n; ++ i) {
		for (int j = 1; j + (1 << i) - 1 <= n; ++ j) {
			dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + (1 << (i - 1))]);
		}
	}

	int a, b, l;
	for (int i = 1; i <= m; ++ i) {
		in >> a >> b;
		l = b - a + 1;
		out << min(dp[p[l]][a], dp[p[l]][b - (1 << p[l]) + 1]) << '\n';
	}

	return 0;
}