#include <iostream>
#include <cstdio>
#include <algorithm>
#define NMAX 100001
#define LMAX 18

using namespace std;

int n, m;
int rmq[NMAX][LMAX];
int lg[NMAX];

int main()
{
	freopen("rmq.in", "r", stdin);
	freopen("rmq.out", "w", stdout);

	scanf("%d", &n);
	scanf("%d", &m);
	for (int i = 1; i <= n; ++i)
		scanf("%d", &rmq[i][0]);

	for (int i = 2; i < NMAX; ++i)
		lg[i] = lg[i >> 1] + 1;

	for (int j = 1; (1 << j) <= n; ++j)
		for (int i = 1; i <= n - j + 1; ++i)
			rmq[i][j] = min(rmq[i][j-1], rmq[i + (1 << (j - 1))][j-1]);

	for (int q = 0; q < m; ++q)
	{
		int i, j;
		scanf("%d", &i);
		scanf("%d", &j);
		int dif = j - i;
		int l = lg[dif];
		int p = 1 << l;
		printf("%d\n", min(rmq[i][l], rmq[j - p + 1][l]));
	}

	return 0;
}