#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

const int N = 100001;
const int M = 18;
int n, m, x, y;
int logaritm[N], rmq[M][M];

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

int main() {
	in >> n >> m;
	for (int j = 1; j <= n; j++) {
		in >> rmq[0][j];
	}
	rmq1();

	logaritm[1] = 0;
	for (int i = 2; i <= n; i++)
		logaritm[i] = 1 + logaritm[i / 2];

	for (int i = 1; i <= m; i++) {
		in >> x >> y;
		int l = logaritm[y - x + 1];
		out << min(rmq[l][y], rmq[l][x + (1 << l) - 1]) << '\n';
	}
	return 0;
}