#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define ll long long 
#define ull unsigned long long 
#define nmax 100005
#define MOD 666013 
#define INF 2345678901
//#define fin cin 
//#define fout cout 

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

int n;
int rmq[17][nmax], e[nmax];

void CreatingE()
{
	e[1] = 0;
	for (int i = 2; i <= 100000; i++)
		e[i] = 1 + e[i / 2];
}

void RMQ()
{
	int i, j, lg, expo;
	for (i = 1; i <= e[n]; i++)
	{
		lg = (1 << i);
		for (j = 1; j <= n - lg + 1; j++)
			rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + lg / 2]);
	}
}

int main()
{
	int i, j, Q, x, y, expo, lg;
	CreatingE();
	fin >> n >> Q;
	for (i = 1; i <= n; i++)
		fin >> rmq[0][i];
	RMQ();
	for (i = 1; i <= Q; i++)
	{
		fin >> x >> y;
		expo = e[y - x + 1];
		lg = (1 << expo);
		fout << min(rmq[expo][x], rmq[expo][y - lg + 1]) << "\n";
	}
	fin.close();
	fout.close();
	return 0;
}