#include <iostream>
#include <fstream>

using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");

const int NMAX=100002;
const int LMAX=18;
long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];

void calculam_logaritm()
{
    lg[1]=0;
	for (long int i=2;i<=n;i++)
		lg[i]=lg[i/2]+1;
}

void precalc()
{
    for (long int i=1;i<=n;i++)
		f>>rmq[0][i];

    long int l;
	for (long int i=1; (1 << i) <=n;i++)
		for (long int j=1;j <= n - (1 << i)+1;j++)
		{
		l=1<<(i-1);
		rmq[i][j]= min( rmq[i-1][j] , rmq[i-1][j+l] );
		}
}

int query(int x,int  y)
{
     long int interval=y-x+1;
     long int m=lg[interval];
     return min(rmq[m][x],rmq[m][x+interval-(1<<m)]);
}

int main()
{


	f>>n>>m;
    calculam_logaritm();
    precalc();


	long int x,y;

	for (long int i=1;i<=m;i++)
	{
		f>>x>>y;
        g<<query(x,y)<<endl;
	}
	return 0;
}