// textbook algorithm

#include <fstream>
using namespace std;

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

const int NMAX = 1e5 + 8;

int rmq[20][NMAX];
int max_pow2[NMAX];

[[nodiscard]] int query(const int st, const int dr) {
	const int temp = dr - st + 1;
	const int l = max_pow2[temp];
	const int sh = temp - (1 << l);
	return min(rmq[l][st], rmq[l][st + sh]);
}

int main() {
	int n, m;
	fin >> n >> m;
	for (int i = 1; i <= n; i++) {
		fin >> rmq[0][i];
		if (i > 1) {
			max_pow2[i] = max_pow2[i / 2] + 1;
		}
	}

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

	for (int i = 1; i <= m; i++) {
		int st, dr;
		fin >> st >> dr;
		fout << query(st, dr) << '\n';
	}
}