#include <bits/stdc++.h>
#define ll long long

using namespace std;

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

int n, m, x, y, dp[25][100100];

int main(){
	in >> n >> m;
	for(int i = 1; i <= n; i++)
		in >> dp[0][i];
	int sz = log2(n);
	for(int p = 1; p <= sz; p++)
		for(int i = 1; i <= n; i++)
			dp[p][i] = min(dp[p - 1][i], dp[p - 1][i + (1 << (p - 1))]);
	while(m--){
		in >> x >> y;
		sz = log2(y - x + 1);
		out << min(dp[sz][x], dp[sz][y - (1 << sz) + 1]) << '\n';
	}
	return 0; 
	
}