#include <iostream>
#include <fstream>
#include <cmath>
#define NMAX 100000

using namespace std;

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

int rmq[18][NMAX+10], n, q;

int main()
{
	fin >> n >> q;
	for(int i=1; i<=n; i++)
		fin >> rmq[0][i];
	for(int bit=1; (1<<bit)<=n; bit++)
		for(int i=1; i<=n; i++)
			rmq[bit][i] = min(rmq[bit-1][i], rmq[bit-1][i+(1<<(bit-1))]);
	while(q--)
		{	int a, b;
			fin >> a >> b;
			int p = log2(b - a + 1);
			fout << min(rmq[p][a], rmq[p][b-(1<<p)+1]) << '\n';
		}
	return 0;
}