#include <fstream>
using namespace std;

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

int rmq[18][100002], l[100002],n,m;
void RMQ(), query();

int main() 
{
	in >> n >> m;
	for (int i = 2; i <= n; i++)
		l[i] = l[i / 2] + 1;
	for (int i = 1; i <= n; i++)
		in >> rmq[0][i];
	RMQ();
	query();
}
void RMQ() 
{
	for (int i = 1; (1 << i) <= n; i++)
		for (int j = 1; j <= n - (1 << i) + 1; j++)
			rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}
void query()
{
	int x, y;
	for(int i=1;i<=m;i++)
	{ 
	in >> x >> y;
	int sh = (y - x + 1) - (1 << l[y - x + 1]);
	out << min(rmq[l[y - x + 1]][x], rmq[l[y - x + 1]][x + sh])<<'\n';
	}

}