#include<cstdio>

 #include<iostream>

 #include<cmath>

 #include<algorithm>

 using namespace std;

 struct node{

     int val;

 }segTree[];

 int a[];

 void build(int root,int arr[],int istart,int iend){

     if(istart==iend){

         segTree[root].val=arr[istart];

     }else{

         int mid=(istart+iend)/;

         build(root*,arr,istart,mid);

         build(root*+,arr,mid+,iend);

         segTree[root].val=max(segTree[root*].val,segTree[root*+].val);

     }

 }

 int query(int root,int nstart,int nend,int qstart,int qend){

     if(qstart>nend||qend<nstart){

         return ;

     }if(qstart<=nstart&&qend>=nend){

         return segTree[root].val;

     }

     int mid=(nend+nstart)/;

     return max(query(root*,nstart,mid,qstart,qend),query(root*+,mid+,nend,qstart,qend));

 }

 int main(){

     int n,m;

     scanf("%d%d",&n,&m);

     for(int i=;i<=n;i++){

         scanf("%d",&a[i]);

     }

     build(,a,,n);

     int x,y;

     for(int i=;i<=m;i++){

         scanf("%d%d",&x,&y);

         printf("%d\n",query(,,n,x,y));

     }

     return ;

 }