#include <iostream>
#include <fstream>

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

const int NMAX=100001;
const int LMAX=17;
long int rmq[LMAX][NMAX];
long int n,m;

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++)
        {
		l=1<<(i-1);
		for (long int j=1;j <= n - (1 << i)+1;j++)
		rmq[i][j]= min( rmq[i-1][j] , rmq[i-1][j+l] );
		}
}

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

int main()
{
	f>>n>>m;
    precalc();
	long int x,y;
	for (long int i=1;i<=m;i++)
	{
		f>>x>>y;
        g<<query(x,y)<<'\n';
	}
	return 0;
}