#include <fstream>

using namespace std;

const int N = 1e5;
const int L = 16;
int rmq[L + 1][N + 1];
int l[N + 1];

int minim(int st, int dr)
{
	int lung = l[dr - st + 1];
	int p = (1 << lung);
	return min(rmq[lung][st + p - 1], rmq[lung][dr]);
}
int main()
{
	ifstream in("rmq.in");
	ofstream out("rmq.out");

	int n, m;
	in >> n >> m;
	for (int i = 1; i <= n; i ++)
	{
		in >> rmq[0][i];
	}

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

	for (int i = 2; i <= n; i ++)
	{
		l[i] = 1 + l[i / 2];
	}

	for (int i = 0; i < m; i ++)
	{
		int st, dr;
		in >> st >> dr;
		out << minim(st, dr) << '\n';
	}

	return 0;
}