#define MAX_N 100000

#include <fstream>
#include <algorithm>
using namespace std;

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

int n, m, sir[MAX_N + 1], M[17][MAX_N + 1];

int main()
{
	fin >> n >> m;
	
	for (int i = 1; i <= n; ++i)
	{
		fin >> sir[i];
		M[0][i] = sir[i];
	}
	
	for (int p = 1; (1 << p) < n; ++p)
	{
		for (int i = 1; (i + (1 << p) - 1) <= n; ++i)
		{
			M[p][i] = min(M[p - 1][i], M[p - 1][i + (1 << p) - 1]);
		}
	}
	
	for (int i = 1, x, y; i <= m; ++i)
	{
		fin >> x >> y;
		int pMax = max(x, y), pMin = min(x, y);
		int p = -1, l = pMax - pMin + 1;
		while ((1 << (++p)) < l);
		--p;
		
		fout << min(M[p][pMin], M[p][pMax - (1 << p) + 1]) << '\n';
	}
	
	fin.close();
	fout.close();
	return 0;
}