#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5,LogN=20;
int Log[N],f[N][LogN+5],a[N];
int n,m,x,y;
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    Log[0]=-1;
    for(int i=1;i<=n;i++){
        f[i][0]=a[i];
        Log[i]=Log[i>>1]+1;
    }
    for(int j=1;j<=LogN;j++){
        for(int i=1;i+(1<<j)-1<=n;i++){
            f[i][j]=max(f[i][j-1],f[i+(1<<j-1)][j-1]);
        }
    }
    while(m--){
        scanf("%d%d",&x,&y);
        int s=Log[y-x+1];
        printf("%d\n",max(f[x][s],f[y-(1<<s)+1][s]));
    }
    return 0;
}