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

int N,M,mat[22][100100];
int lg[100100],X,Y;

inline int minim(int X,int Y)
{
	int lin=lg[Y-X+1];
	return min(   mat[lin][X],mat[lin][Y-(1<<(lin))+1]   );
}

int main()
{
	ifstream fin("rmq.in");
	ofstream fout("rmq.out");
	
	fin>>N>>M;
	
	for(int i=1;i<=N;++i)
	{
		fin>>mat[0][i];
	}
	
	for(int i=2;i<=N;++i)
		lg[i]=lg[i>>1]+1;
	
	for(int i=1;(1<<i)<=N;++i)
	{
		for(int j=1;j<=N;++j)
		{
			mat[i][j]=min(  mat[i-1][j],  mat[i-1][j+(1<<(i-1))]  );
		}
	}
	
	for(;M>0;--M)
	{
		fin>>X>>Y;
		fout<<minim(X,Y)<<'\n';
	}
	
	fout.close();
	return 0;
}