#define MAX_N 100000
#define MAX_LOG2_N 16

#include <fstream>
#include <algorithm>
using namespace std;

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

int n, m, a[MAX_N + 1][MAX_LOG2_N + 1], l[MAX_N + 1];

int main()
{
	fin >> n >> m;
	for (int i = 1; i <= n; ++i)
		fin >> a[i][0];
	for (int p = 1; (1 << p) <= n; ++p)
	{
		l[1 << p] = p;
		for (int i = 1; (i + (1 << p) - 1) <= n; ++i)
			a[i][p] = min(a[i][p - 1], a[i + (1 << (p - 1))][p - 1]);
	}
	for (int i = 3; i <= n; ++i)
		if (!l[i])
			l[i] = l[i >> 1] + 1;
	for (int i = 1; i <= m; ++i)
	{
		int x, y;
		fin >> x >> y;
		fout << min(a[x][l[y - x + 1]], a[y - (1 << l[y - x + 1]) + 1][l[y - x + 1]]) << '\n';
	}
    fin.close();
    fout.close();
    return 0;
}