#include <iostream>
using namespace std;

int a[100005][20];
main(){
    cin.tie(0)->sync_with_stdio(0);
    int n,q;
    cin>>n>>q;
    for (int i=1;i<=n;i++) cin>>a[i][0];
    for (int k=1;k<19;k++){
        for (int i=1;i+(1<<(k-1))<=n;i++) a[i][k]=max(a[i][k-1],a[i+(1<<(k-1))][k-1]);
    }
    while (q--){
        int l,r;
        cin>>l>>r;
        int k=__lg(r-l+1);
        cout<<max(a[l][k],a[r-(1<<k)+1][k])<<"\n";
    }
}