#include<cstdio>
#include<algorithm>
using namespace std;

int n, m, a[22][100005];
int l[100005];

int main() {
	int i, j, x, y, dif, line;
	
	freopen("rmq.in", "r", stdin);
	freopen("rmq.out", "w", stdout);
	scanf("%d%d", &n, &m);
	for(i = 1; i <= n; ++i)
		scanf("%d", &a[0][i]);
	
	for (i = 2; i <= n; i++)
		l[i] = l[i / 2] + 1;

	for(i = 1; (1 << i) <= n; ++i)
		for(j = 1; j <= n - (1 << i) + 1; ++j)
			a[i][j] = min(a[i - 1][j], a[i - 1][j + (1 << (i - 1))]);
	
	for(i = 1; i <= m; ++i) {
		scanf("%d%d", &x, &y);
		dif = y - x + 1;
		line = l[dif];
		printf("%d\n", min(a[line][x], a[line][x + dif - (1 << line)]));
	}
	return 0;
}