#include <fstream>
#include <algorithm>

using namespace std;

const int NMAX = 100005;
int n, m, rmq[18][NMAX], lg[NMAX];

int main()
{
	ifstream fin("rmq.in");
	ofstream fout("rmq.out");
	fin >> n >> m;
	for (int i = 1;i <= n;++i)
		fin >> rmq[0][i];
	lg[1] = 0;
	for (int i = 2;i <= n;++i)
		lg[i] = lg[i >> 1] + 1;
	for (int p = 1;(1 << p) <= n;++p)
		for (int i = 1;i + (1 << p) - 1 <= n;++i)
			rmq[p][i] = min(rmq[p - 1][i], rmq[p - 1][i + (1 << (p - 1))]);
	for (int i = 1;i <= m;++i)
	{
		int a, b;
		fin >> a >> b;
		int p = lg[b - a + 1];
		fout << min(rmq[p][a], rmq[p][b - (1 << p) + 1]) << "\n";
	}
	fin.close();
	fout.close();
	return 0;
}