#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int a[100001][17],n;

int main()
{
    int x,y,m,i,s,min,j,k,p1,p,l;
    fin>>n>>m;
    l=log2(n);
    for (i=1;i<=n;i++) {fin>>a[i][0];}
    for (j=1;j<=l;j++)
    {
        p=1<<(j-1); p1=1<<j-1;
        for (i=1;i+p1<=n;i++)
        {
            if (a[i][j-1]<a[i+p][j-1]) a[i][j]=a[i][j-1];
            else a[i][j]=a[i+p][j-1];
        }
    }
    for (k=1;k<=m;k++)
    {
        fin>>x>>y;
        s=log2(y-x+1);
        if (a[x][s]>a[y-(1<<s)][s]) fout<<a[x][s];
        else fout<<a[y-(1<<s)+1][s];
        fout<<"\n";
    }

}