#include <fstream>
#include <algorithm>

using namespace std;

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

const int MAX_N = 100005;
const int MAX_logN = 20;

int n, m, A[MAX_N], lg_2[MAX_N], rmq[MAX_N][MAX_logN];

// rmq[i][j] = indicele minimului in vectorul care incepe pe pozitia i si are lungimea 2^j

void read() {
	f >> n >> m;
	for (int i = 1; i <= n; i++)
		f >> A[i];
}

void precompute() {
	lg_2[1] = 0;
	for (int i = 2; i <= n; i++)
		lg_2[i] = lg_2[i / 2] + 1;
	
	for (int i = 1; i <= n; i++)
		rmq[i][0] = i;
	
	for (int j = 1; (1 << j) <= n; j++)
		for (int i = 1; i + (1 << (j - 1)) <= n; i++)
			if (A[rmq[i][j - 1]] <= A[rmq[i + (1 << (j - 1))][j - 1]])
				rmq[i][j] = rmq[i][j - 1];
			else
				rmq[i][j] = rmq[i + (1 << (j - 1))][j - 1];
}

void solve() {
	while (m--) {
		int i, j;
		
		f >> i >> j;
		int k = lg_2[j - i + 1];
		
		g << min(A[rmq[i][k]], A[rmq[j - (1 << k) + 1][k]]) << '\n';
	}
}

int main() {
	read();
	precompute();
	solve();
	
	f.close();
	g.close();
	
	return 0;
}