#include <fstream>
#include <algorithm>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, st, dr, v[100005], M[100005][25];
void rmq()
{
	int i, k, j;
	for (i = 1; i <= n; i++)
		M[i][0] = v[i];
	for (k = 0; (1 << (k + 1)) <= n; k++);
	for (j = 1; j <= k; j++)
		for (i = 1; i <= n - (1 << j)+1; i++)
			M[i][j] = min(M[i][j - 1], M[i + (1 << (j - 1))][j - 1]);
}
int main()
{
	int i,k;
	fin >> n >> m;
	for (i = 1; i <= n; i++)
		fin >> v[i];
	rmq();
	for (i = 1; i <= m; i++)
	{
		fin >> st >> dr;
		for (k = 0; (1 << (k + 1)) <= dr-st+1; k++);
		fout << min(M[st][k], M[dr - (1 << k) + 1][k])<<'\n';
	}
	return 0;
}