#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
#define LENGTH 100000
#define LOGLENGTH 17
int RMQ[LENGTH][LOGLENGTH];

int main()
{
	int n, m, v[LENGTH], i, j, k;
	in >> n >> m;
	for (i = 0; i < n; i++) in >> v[i];
	for (i = 0; i < n; i++)
	RMQ[i][0] = i;
	for (j = 1; 1 << j <= n; j++)
	{
		for (i = 0; i + (1 << j) - 1 < n; i++)
		{
			RMQ[i][j] = v[RMQ[i][j - 1]] < v[RMQ[i + (1 << (j - 1))][j - 1]] ? RMQ[i][j - 1] : RMQ[i + (1 << (j - 1))][j - 1];
		}
	}
	while (m)
	{
		in >> i >> j;
		i--;
		j--;
		k = 1;
		for (k = 1; 1<<k <= j - i + 1; k++);
		k--;
		if (v[RMQ[i][k]] < v[RMQ[j - (1 << k) + 1][k]]) out << v[RMQ[i][k]]<<'\n';
		else out << v[RMQ[j - (1 << k) + 1][k]]<<'\n';
		m--;
	}
	return 0;
}