#include<fstream>
using namespace std;
int n, m, i, j, d[17][100007], v[100007], x, y, p;

int minim(int x, int y)
{
	return x < y ? x : y;
}

ifstream in("rmq.in");
ofstream out("rmq.out");

int main()
{
	in >> n >> m;
	for (i = 1; i <= n; i++)
		in >> d[0][i];
	for (i = 2; i <= n; i++)
		v[i] = 1 + v[i >> 1];
	for (i = 1; (1 << i) <= n; i++)
	{
		for (j = 1; j <= n; j++)
			d[i][j] = minim(d[i - 1][j], d[i - 1][j + (1 << (i - 1))]);
	}
	for (i = 1; i <= m; i++)
	{
		in >> x >> y;
		p = v[y - x + 1];
		out << minim(d[p][x], d[p][y - (1 << p) + 1]) << "\n";
	}
	return 0;
}