#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e5 + 2, MAX_LG = 18;

int n, m, a[MAX_N], Log[MAX_N], Rmq[MAX_LG][MAX_N];

void PrecalcLog()
{
	for (int i = 2; i <= n; ++i)
		Log[i] = Log[i / 2] + 1;
}

void PrecalcRmq()
{
	for (int i = 1; (1 << i) <= n; ++i)
	{
		int delta = 1 << (i - 1);

		for (int j = 1; j + (1 << i) - 1 <= n; ++j)
		{
			Rmq[i][j] = min(Rmq[i - 1][j], Rmq[i - 1][j + delta]);
		}
	}
}

int query_min(int x, int y)
{
	int dif = Log[y - x + 1];
	return min(Rmq[dif][x], Rmq[dif][y - (1 << dif) + 1]);
}

int main()
{
	ifstream cin("rmq.in");
	ofstream cout("rmq.out");

	cin >> n >> m;

	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i];
		Rmq[0][i] = a[i];
	}
	PrecalcLog();
	PrecalcRmq();

	for (int i = 1; i <= m; ++i)
	{
		int x, y;
		cin >> x >> y;
		cout << query_min(x, y) << '\n';
	}
}