#include <fstream>
#define Nmax 100002
#define Lmax 20

using namespace std;

int A[Nmax][Lmax], lg[Nmax], v[Nmax], n, m, i, j, x, y, t, dif;

int min(int x, int y) {
	return x < y ? x : y;
}

int main() {
	
	ifstream f("rmq.in");
	ofstream g("rmq.out");
	
	f >> n >> m;
	for (i = 1; i <= n; i++)
		f >> v[i];
	
	for (i = 1; i <= n; i++)
		A[i][0] = v[i];
	
	//lg[i] = cea mai mica putere de 2 mai mica decat i
	lg[1] = 0;
	for (i = 2; i <= n; i++)
		lg[i] = lg[i / 2] + 1;
	
	//A[i][j] = minimul din secventa de lungime 2 ^ j care incepe in i
	for (j = 1; (1 << j) <= n; j++)
		for (i = 1; i <= n - (1 << j) + 1; i++)
			A[i][j] = min(A[i][j-1], A[i + (1 << (j-1))][j-1]);
	
	for (i = 1; i <= m; i++) {
		f >> x >> y;
		dif = y - x + 1;
		t = lg[dif];
		g << min(A[x][t], A[y - (1 << t) + 1][t]) << "\n";
	}
	
	return 0;
}