#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");

const int NMAX = 100001;
const int LMAX = 17;

int r[LMAX][NMAX];
int E[NMAX];
int n, m;

int main()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		cin >> r[0][i];
	for(int p=1;(1<<p)<=n;p++)
		for (int i = 1; i <= n; i++)
		{
			r[p][i] = r[p - 1][i];
			int j = i + (1 << (p - 1));
			if(j<=n && r[p][i]>r[p - 1][j])
				r[p][i] = r[p - 1][j];
		}
	E[1] = 0;
	for (int i = 2; i <= n; i++)
		E[i] = 1 + E[i / 2];
	for (int i = 0; i < m; i++)
	{
		int st, dr;
		cin >> st >> dr;
		int e = E[dr - st + 1];
		int len = (1 << e);
		cout << min(r[e][st], r[e][dr - len + 1]) << '\n';
	}
	return 0;
}