#include<iostream>
#include<fstream>
using namespace std;
const int LMAX = 17;
int a[LMAX+1][100001],lg[100001];
int main ()
{
	int n,i,m,j,k;
	ifstream f("rmq.in");
	ofstream g("rmq.out");
	f>>n>>m;
	for(i=1;i<=n;i++)
		f>>a[0][i];
	lg[1]=0;
	for(i=2;i<=n;i++)
		lg[i]=lg[i/2]+1;
	for(i=1;(1<<i)<=n;i++)
		for(j=1;j<=n-(1<<i)+1;j++) 
			a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
	for(k=1;k<=m;k++) {
		f>>i>>j;
		g<<min(a[lg[j-i+1]][i],a[lg[j-i+1]][j-(1<<(lg[j-i+1]))+1])<<'\n';
	}
	f.close();
	g.close();
	return 0;
}