//am reutilizat codul de la arbori de intervale
#include<bits/stdc++.h>
using namespace std;

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

//const int N_max= 100000;
int MaxArb[400001],start,finish,n,m,nr,val;

void Update(int nod, int left, int right,int pos,int val)
{
    if ( left == right )
    {
        MaxArb[nod] = val;
        return;
    }
    int middle = (left+right)/2;
    if ( pos <= middle )
        Update(2*nod,left,middle,pos,val);
    else
        Update(2*nod+1,middle+1,right,pos,val);
    MaxArb[nod] = max(MaxArb[2*nod], MaxArb[2*nod+1]);
}


int Query_max(int nod, int left,int right,int limitleft,int limitright)
{

    /*if (left > right || left>limitright || right < limitleft)
        return;*/
    if(limitleft<=left && right<=limitright)
    {
        return MaxArb[nod];
    }

    int middle= (left+right)/2;
    int Left,Right;
    Left=Right=-100001;
    //=-100001;
    if(limitleft<=middle)
        Left=Query_max(2*nod,left,middle,limitleft,limitright);
    if(middle<limitright)
        Right=Query_max(2*nod+1,middle+1,right,limitleft,limitright);
    return max(Left,Right);
}

int main()
{
    //adaugam numerele cu minus si interogam maximul
    f>>n>>m;
    for(int i=1; i<=n; ++i)
    {
        f>>nr;
        Update(1,1,n,i,-nr);
    }

    for(int i=1; i<=m; ++i)
    {
        f>>start>>finish;
        g<<-1*Query_max(1,1,n,start,finish)<<'\n';
        //Query_max(1,1,n,start,finish,maxim);
        //g<<-maxim<<'\n';

    }
    return 0;
}