#include <fstream>
#include <cmath>
#define N 100010
using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int n, m, dp[20][N], a[N];
auto minn = [](int a, int b) {return (a < b ? a : b); };
int main()
{
	int x, y;
	f >> n >> m;
	for (int i = 0; i < n; i++)
		f >> dp[0][i];
	for (int i = 1; (1 << i) <= n; i++)
		for (int j = 0; j + (1 << (i - 1)) < n; j++)
			dp[i][j] = minn(dp[i - 1][j], dp[i - 1][j + (1 << (i - 1))]);
	while(m--)
	{
		f >> x >> y;
		x--, y--;
		int k = log2(y - x + 1);
		g << minn(dp[k][x], dp[k][y - (1 << k) + 1]) << '\n';
	}
	return 0;
}