#include <fstream>
#include <climits>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <cstring>
#include<algorithm>

using namespace std;


int n, q;
const int LOGMAX = 19;
int lg[100001];
int a[100001][LOGMAX];

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

void calc()
{
	for (int j = 1; (1 << j) <= n; j++)
	{
		for (int i = 1; i + (1 << j) - 1 <= n; i++)
		{
			//secventa de la i la i+1<<j are minimul
			//egal cu minimul de la i si secv 1<<(j-1) si i+1<<(j-1)
			//concret pt indicele 4 luat de secv 2 avem minimul de la 4 si minimul de la 4+1 ambele luate de lungime 1 
			a[i][j] = min(a[i][j - 1], a[i + (1 << (j - 1))][j - 1]);
		}
	}
}

int query(int L, int R)
{
	int lung = R - L + 1;
	//calculez cea mai mare putere de 2 care incape in lung; O(log(lung))
	//sau imi precalculez puterile cu un vector
	int k = lg[lung];


	return min(a[L][k], a[R+1 - (1 << k)][k]);
}

int main()
{
	fin >> n >> q;
	lg[1] = 0;
	for (int i = 1; i <= n; i++)
	{
		fin >> a[i][0];
		if (i >= 2)
		{
			lg[i] = lg[i / 2] + 1;
		}
		

	}


	calc();
	for (int i = 1; i <= q; i++)
	{
		int x, y;
		fin >> x >> y;
		fout << query(x, y) << "\n";
	}
	return 0;
}