#include <cstdio>

const int MAX_N = 100001;
const int MAX_P = 20;

int n, m;
int a[MAX_N][MAX_P];

int min(int a, int b) { return (a < b) ? a : b; }

int main()
{
	int i, k, x, y;

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

	scanf("%d %d", &n, &m);

	int pow = 0;

	for (; 1 << (pow + 1) <= n; ++pow);

	for (k = 0; k <= pow; ++k)
		for (i = 1; i <= n; ++i)
			if (k == 0)
				scanf("%d", &a[i][k]);
			else 
				a[i][k] = min(a[i][k - 1], (i + (1 << (k - 1)) <= n) ? a[i + (1 << (k - 1))][k - 1] : a[i][k - 1]);

	for (i = 1; i <= m; ++i)
	{
		scanf("%d %d", &x, &y);

		for (k = 0, pow = 1; (pow << 1) <= (y - x); pow <<= 1, ++k);

		printf("%d\n", min(a[x][k], a[y - pow + 1][k]));
	}
}