#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;

#define NMAX 100001
#define LMAX 18

int rmq[LMAX][NMAX],lg[NMAX],v[NMAX];

int minim(int x, int y)
{
	int l;
	l=(y-x+1);
	return min(rmq[lg[l]][x],rmq[lg[l]][y+1-(1<<lg[l])]);
}

int main ()
{
	int n,m,i,j,x,y;
	ifstream f("rmq.in");
	ofstream g("rmq.out");
	f>>n>>m;
	for(i=1;i<=n;i++)
		f>>v[i];
	lg[1]=0;
	for(i=2;i<=n;i++)
		lg[i]=lg[i/2]+1;
	for(i=1;i<=n;i++)
		rmq[0][i]=v[i];
	for(i=1;(1<<i)-1<=n;i++)
		for(j=1;j<=n-(1<<i)+1;j++)
			rmq[i][j]=min(rmq[i-1][j],rmq[i-1][(1<<i)+j-(1<<(i-1))]);
	for(i=1;i<=m;i++) {
		f>>x>>y;
		g<<minim(x,y)<<'\n';
	}
	f.close();
	g.close();
	return 0;
}