#include <fstream>
#include <algorithm>

using namespace std;

int n, m;
int rmq[18][100002];
int lg[100002];

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

	fin >> n >> m;
	for (int i = 1; i <= n; ++i)
		fin >> rmq[0][i];
	for (int i = 2; i <= n; ++i)
		lg[i] = lg[i >> 1] + 1;

	for (int i = 1; i <= lg[n]; ++i)
		for (int j = 1; j <= n; ++j)
		{
			rmq[i][j] = rmq[i - 1][j];
			if (j + (1 << (i - 1)) <= n)
				rmq[i][j] = min(rmq[i][j], rmq[i - 1][j + (1 << (i - 1))]);
		}

	for (int i = 1, x, y; i <= m; ++i)
	{
		fin >> x >> y;

		int k = lg[y - x + 1];
		fout << min(rmq[k][x], rmq[k][y - (1 << k) + 1]) << '\n';
	}

	fin.close();
	fout.close();
}