//https://infoarena.ro/problema/rmq
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("fast-math")
//#pragma GCC optimize ("unroll-loops")
#include <iostream>
#include <fstream>
using namespace std;

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

int mat[20][100010], l[100010];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, m, x, y, i, j;
	fin >> n >> m;
	for (i = 1; i <= n; ++i)
	{
		fin >> mat[0][i];
		if (i != 1)
			l[i] = l[i >> 1] + 1;// /2
	}
	/*for (i = 1; i <= n; ++i)
	{
		cout << l[i] << "\n";
	}*/

	for (i = 1; (1 << i) <= n; ++i)// 2^i
	{
		for (j = 1; j <= n - (1 << i) + 1; ++j)// 2^i
		{
			mat[i][j] = min(mat[i - 1][j], mat[i - 1][j + (1 << (i - 1))]);
		}
	}
	//cout << "\n\n";
	//for (i = 0; (1 << i) <= n; ++i)// 2^i
	//{
	//	for (j = 0; j <= n - (1 << i) + 1; ++j)// 2^i
	//	{
	//		cout << mat[i][j] << " ";
	//	}
	//	cout << "\n";
	//}

	for (i = 1; i <= m; ++i)
	{
		fin >> x >> y;
		fout << min(mat[l[y - x + 1]][x], mat[l[y - x + 1]][y - (1 << l[y - x + 1]) + 1]) << "\n";
	}
	return 0;
}