#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100006;
const int LOG = 26;
ifstream in("rmq.in");
ofstream out("rmq.out");
int a[N], n, m, lg[N], dp[N][LOG];
int main() {
	// dp[i][j] --> elementul minim din subsirul [i ..  i + 2 ^ j - 1].
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	in >> n >> m;
	for (int i = 1; i <= n; i++) {
		in >> a[i];
		dp[i][0] = a[i];
	}
	for (int j = 1; (1 << j) <= n; j++) {
		for (int i = 1; i <= n - (1 << j) + 1; i++) {
			dp[i][j] = min(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);
		}
	}
	lg[1] = 0;
	for (int i = 2; i < N; i++) lg[i] = lg[i / 2] + 1;
	for (int i = 1; i <= m; i++) {
		int l, r;
		in >> l >> r;
		int x = lg[r - l + 1];
		out << min(dp[l][x], dp[r - (1 << x) + 1][x]) << '\n';
	}
	// 8 3 4 5 7 1 2 3
	//   -         -
	// 2 -->
	// dp[1][0] 
	// dp[i][j] --> min(dp[i][j - 1], dp[i + 2^(j - 1)][j - 1]. 
  	return 0;
}