#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const int MX = 1e5+1;
int st[MX][17], A[MX], n, m;

int main() {
	freopen ("rmq.in", "r", stdin);
	//freopen ("rmq.out", "w", stdout);
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> A[i];
		st[i][0] = A[i];
	}
	for (int i = 1; (1 << i) <= n; i++) {
		for (int j = 0; j + (1 << i) - 1 < n; j++) {
			st[j][i] = min(st[j][i-1], st[j + (1 << (i-1))][i-1]);
		}
	}
	int x, y, lg[MX];
	lg[1] = 0;
	for (int i = 2; i <= n; i++) {
		if ((1 << lg[i-1]) <= i) lg[i] = lg[i-1];
		else lg[i] = lg[i-1]+1;
	}
	for (int i = 0; i < m; i++) {
		cin >> x >> y;
		x--, y--;
		int k = lg[x-y+1];
		cout << min(st[x][k], st[y - (1 << k) + 1][k]) << '\n';
	}
	return 0;
}