using namespace std;
#include<fstream>
ifstream eu("rmq.in");
ofstream tu("rmq.out");
#define Nmax 100005
int Log2[Nmax],RMQ[20][Nmax],N,M;
void read()
{
	eu>>N>>M;
	for(int i=1;i<=N;i++)
		eu>>RMQ[0][i];
	for(int i=2;i<=N;i++)
		Log2[i]=Log2[i/2]+1;
	for(int i=1;(1<<i)<=N;i++)
		for(int j=1;j<=N-(1<<i)+1;j++)
			RMQ[i][j]=min(RMQ[i-1][j],RMQ[i-1][j+(1<<i-1)]);
}
void solve()
{
	int x,y,dist,k,minim;
	while(M--)
	{
		eu>>x>>y;
		dist=y-x+1;
		k=Log2[dist];
		minim=min(RMQ[k][x],RMQ[k][y-(1<<k)+1]);
		tu<<minim<<"\n";
	}
}
int main()
{
	read();
	solve();
	return 0;
}