#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 Log2(int x);

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 = 0, x, y; i < m; ++i)
	{
		fin >> x >> y;
		int p = Log2(y - x);
		int l = 1 << p;
		
		fout << min(M[p][x], M[p][y - l + 1]) << '\n';
	}
	
	fin.close();
	fout.close();
	return 0;
}

int Log2(int x)
{
	for (int i = sizeof(x) * 8 - 1; i >= 0; --i)
	{
		if (x & (1 << i))
		{
			return i;
		}
	}
	
	return 0;
}