#include <fstream>
#include <algorithm>
#define NMAX 100001
using namespace std;

int main()
{
	int N, M, RMQ[NMAX][18], V[NMAX], i, j, a, b, log[NMAX];
	ifstream f("rmq.in");
	ofstream g("rmq.out");
	f >> N >> M;
	for (i = 0; i < N; i++)
	{
		f >> V[i];
	}
	log[0] = -1;
	for (i = 1; i <= N; i++)
	{
		if (1 << (log[i - 1] + 1) > i)
		{
			log[i] = log[i - 1];
		}
		else
		{
			log[i] = log[i - 1] + 1;
		}
	}

	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++)
		{
			if (V[RMQ[i][j - 1]] < V[RMQ[i + (1 << (j - 1))][j - 1]])
			{
				RMQ[i][j] = RMQ[i][j - 1];
			}
			else
			{
				RMQ[i][j] = RMQ[i + (1 << (j - 1))][j - 1];
			}
		}
	}
	for (i = 1; i <= M; i++)
	{
		f >> a >> b;
		a--; b--;
		int k = log[b - a + 1];
		g << min(V[RMQ[a][k]], V[RMQ[b - (1 << k) + 1][k]]) << "\n";
	}

	f.close();
	g.close();
	return 0;
}