#include <fstream>
#include <cmath>

using namespace std;

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

int pre[19][100001];
int max_pow = 0;


int find_min(int start, int end) {
	int len = end - start + 1;

	if(len == 1) return pre[0][start];

	int pow = min((int)floor(log2(len)), max_pow);
	if ((len & (len - 1)) == 0) {
		return pre[pow][start];
	}
	while (len & (len - 1)) {
		len = len & (len - 1);
	}
	return min(pre[pow][start], find_min(start + len, end));
}

void compute_pre(int n) {
	int len, aux;
	bool ch;
	for(int j = 1; j <= ceil(log2(n)); ++j) {
		len = 1 << (j - 1);
		ch = false;
		for(int i = 0; i < n; ++i) {
			aux = pre[j - 1][i];
			pre[j][i] = (i + len < n) ? min(pre[j - 1][i], pre[j - 1][i + len]) : pre[j - 1][i];
			ch = aux != pre[j][i] || ch;
		}
		if (!ch) {
			return;
		}
		max_pow = j;
	}
}

void read() {
	int n, q;
	in >> n >> q;

	for(int i = 0; i < n; ++i) {
		in >> pre[0][i];
	}

	compute_pre(n);

	int a, b;
	for(; q; --q) {
		in >> a >> b;
		--a; --b;
		out << find_min(a, b) << '\n';
	}
}
int main() {
	read();
	return 0;
}