#include <bits/stdc++.h>

using namespace std;

const int N = (int) 1e5 + 7;
const int K = 17;
int rmq[K][N], n, q, lg[N];

int main() {
#ifdef INFOARENA
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	freopen ("rmq.in", "r", stdin);
	freopen ("rmq.out", "w", stdout);
#endif

	cin >> n >> q;
	for (int i = 1; i <= n; i++) {
		cin >> rmq[0][i];
	}
	for (int k = 1; k < K; k++) {
		for (int i = 1; i + (1 << k) - 1 <= n; i++) {
			rmq[k][i] = min(rmq[k - 1][i], rmq[k - 1][i + (1 << (k - 1))]);
		}
	}
	for (int i = 2; i <= n; i++) {
		lg[i] = 1 + lg[i / 2];
	}
	while (q--) {
		int l, r, k;
		cin >> l >> r;
		k = lg[r - l + 1];
		cout << min(rmq[k][l], rmq[k][r - (1 << k) + 1]) << "\n";
	}
	return 0;
}