#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>

#define zeros(pos) ((pos^(pos-1))&pos)

using namespace std;

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

const int NMAX = 200005;
const int LOGMAX = 20;

int rmq[NMAX][LOGMAX];
int v[NMAX];
int l2[NMAX];

long long n, q, a, b, x;

void precalcLog()
{
	l2[1] = 0;
	for (int i = 2; i <= n; i++)
		l2[i] = l2[(i / 2)] + 1;
}

void precalc()
{
	for (int i = 1; i <= n; i++)
		rmq[i][0] = v[i];
	for (int j = 1; (1 << j) <= n; j++)
		for (int i = 1; i + (1 << j) - 1 <= n; i++)
			rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << j) - 1][j - 1]);
}

int query(int i, int j)
{
	int l = j - i + 1;
	int lg = l2[l];
	return min(rmq[i][lg], rmq[j - (1 << lg) + 1][lg]);
}

int main()
{
	ios_base::sync_with_stdio(false);
	fin.tie(0); fout.tie(0);
	fin >> n >> q;
	for (int i = 1; i <= n; i++)
		fin >> v[i];
	precalcLog();
	precalc();
	while (q--)
	{
		fin >> a >> b;
		fout << query(a, b) << '\n';
	}
	return 0;
}