/*#include <cstdio>
#include<fstream>
using namespace std;
#define NMAX 100002
using namespace std;

long int rmq[20][NMAX];
long int n,m,ul;
long int lg[NMAX];
long int a[NMAX];

inline long int min(long int a, long int b)
{
if(a<b)
	return a;
return b;
}

int main()
{
	int i;
	ifstream fin("rmq.in");
	ofstream fout("rmq.out");
	fin>>n>>m;
	lg[1]=0;
	fin>>a[1];
	rmq[0][1]=a[1];

	for (i=2;i<=n;i++)
	{
		fin>>a[i];
		rmq[0][i]=a[i];
		lg[i]=lg[i/2]+1;
	}
	int j,l;
	for (i=1;(1<<i) <=n;i++)
	{
		long int aa = n-(1<<i)+1;
		l=1<<((i-1));

		for (j=1;j <= aa;j++)
		{
		if(rmq[i-1][j] < rmq[i-1][j+l])
			rmq[i][j]= rmq[i-1][j];
		else
			rmq[i][j]= rmq[i-1][j+l];
		}
	}

	long int x,y,diff,sh;

	for (i=1;i<=m;i++)
	{
		fin>>x>>y;
		diff=y-x+1;
		l=lg[diff];
		sh=diff - (1<<l);
		fout<<min(rmq[l][x],rmq[l][x+sh])<<"\n";
	}
	return 0;
}*/
#include <fstream>

using namespace std;

int a[100010][19],n,m,i,x,y,k,b[19];
short j,lg;

inline int min (int a,int b)
{
    if (a<b) return a;
    return b;
}

int main () {
    ifstream in ("rmq.in");
    ofstream out ("rmq.out");
    in>>n>>m;
    for (i=0; i<n; i++) in>>a[i][0];
    lg=31-__builtin_clz(n);
    for (i=1,k=1; i<=lg; i++,k<<=1) {
        x=n-k;
        for (j=0; j<=x; j++) a[j][i]=min(a[j][i-1],a[j+k][i-1]);
    }
    b[0]=1; for (j=1; j<19; j++) b[j]=b[j-1]<<1;
    for (; m; m--) {
        in>>x>>y;
        j=31-__builtin_clz(y-x+1);
        out<<min(a[x-1][j],a[y-b[j]][j])<<"\n";
    }
    return 0;
}