#include<cstdio>
#include<cstdlib>
using namespace std;
int max,arb[4*100000+1],val,pos,n,m,start,finish,x,y;
int inf=-100001;
int maxim(int a,int b)
{if(a>b) return a;
return b;}
void update(int nod,int st,int dr)
{if(st==dr) {arb[nod]=val;return ;}
int div=(st+dr)/2;
if(pos<=div) update(2*nod,st,div);
else update(2*nod+1,div+1,dr);
arb[nod]=maxim(arb[2*nod],arb[2*nod+1]);
}
void query(int nod,int st,int dr)
{if(start<=st && dr<=finish) {if(max<arb[nod]) max=arb[nod];return;}
int div=(st+dr)/2;
if(start<=div) query(2*nod,st,div);
if(div<finish) query(2*nod+1,div+1,dr);
}

int main()
{     freopen("rmq.in","r",stdin);
      freopen("rmq.out","w",stdout);
      scanf("%d %d",&n,&m);
      for(int i=1;i<=n;i++) {scanf("%d",&x);val=-x;pos=i;update(1,1,n);}
      for(;m;m--){scanf("%d %d",&x,&y);start=x;finish=y;max=inf;query(1,1,n);printf("%d \n",-max);}



      return 0;
}