#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>

using namespace std;

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

int rmq[19][100002];
int n, m, st, dr;
int main()
{
	fin >> n >> m;
	for (int i = 1; i <= n; i++)
		fin >> rmq[0][i];
	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))]);

	for (int i = 1; i <= m; i++)
	{
		fin >> st >> dr;
		int k = (int)log2(dr - st);
		fout << min(rmq[k][st], rmq[k][dr - (1 << k) + 1])<<"\n";
	}
	return 0;
}