#include <algorithm>
#include <fstream>
#define DIM 100010

using namespace std;

int lg[DIM], n, m;
int rmq[DIM][20];

void CreateLg()
{
	lg[1] = 0;
	for (int i = 2;i <= n;++i)
		lg[i] = lg[i >> 1] + 1;
}

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