#include <bits/stdc++.h>
#include <unordered_map>
#define nmax 100006
#define MOD 1999999973
#define INF 2012345678
#define ll long long
using namespace std;
//#define fin cin
//#define fout cout

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

int n;
int rmq[18][nmax], e[nmax];

void MakeE()
{
	for (int i = 2; i <= n; i++)
		e[i] = e[i / 2] + 1;
}

void RMQ()
{
	int lg, i, j;
	for (i = 1; i <= e[n]; i++)
	{
		lg = (1 << i);
		for (j = 1; j <= n - lg + 1; j++)
			rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + lg / 2]);
	}
}

int main()
{
	int i, j, Q, expo, lg;
	fin >> n >> Q;
	for (i = 1; i <= n; i++)
		fin >> rmq[0][i];

	MakeE();
	RMQ();

	while (Q--)
	{
		fin >> i >> j;
		expo = e[j - i + 1];
		lg = (1 << expo);
		fout << min(rmq[expo][i], rmq[expo][j - lg + 1]) << "\n";
	}
	fin.close();
	fout.close();
	return 0;
}