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

using namespace std;

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

int main()
{
	fstream in("rmq.in", ios::in);
	fstream out("rmq.out", ios::out);

	in >> n >> m;
	for (int i = 1; i <= n; ++i)
		in >> 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;
		in >> i >> j;
		int dif = j - i;
		int l = lg[dif];
		int p = 1 << l;
		out << min(rmq[i][l], rmq[j - p + 1][l]) << '\n';
	}

	in.close();
	out.close();

	return 0;
}