#include<fstream>
using namespace std;
int n,m,v[100100],rmq[100100][20],put[100100];
//rmq[i][k]=minimul de pe intervalul [i,...,i+(1<<k)-1],care este de lungime (1<<k)
//put[i]=cel mai mare k,astfel incat (1<<k)<=i

int main()
{
	int i,k,lg,dif,exp,lim,st,dr;
	ifstream fin("rmq.in");
	ofstream fout("rmq.out");
	fin>>n>>m;
	for(i=1;i<=n;i++)
		fin>>v[i];
	
	for(i=1;i<=n;i++)
		rmq[i][0]=v[i];
	for(k=1;(1<<k)<=n;k++)
	{
		lim=n-(1<<k)+1;
		for(i=1;i<=lim;i++)
		{
			lg=(1<<(k-1));
			rmq[i][k]=min(rmq[i][k-1],rmq[i+lg][k-1]);
			//min( intervalul i...i+(1<<(k-1))-1 , intervalul i+(1<<(k-1))...i+2*(1<<(k-1))-1 = i+(1<<k)-1 )
		}
	}
	put[1]=0;
	for(i=2;i<=n;i++)
		put[i]=put[i/2]+1;
	
	for(i=1;i<=m;i++)
	{
		fin>>st>>dr;
		lg=dr-st+1;
		exp=put[lg];
		dif=lg-(1<<exp);
		fout<<min(rmq[st][exp],rmq[st+dif][exp])<<"\n";
		//min( intervalul st...st+(1<<exp)-1 , intervalul st+lg-(1<<exp)...st+lg-1 = dr )
	}
	fin.close();
	fout.close();
	return 0;
}