#include #define LL long long #define Re register int const int N=1e5+3; int n,x,y,T,A[N]; inline void in(Re &x){ int f=0;x=0;char ch=getchar(); while(ch<'0'||ch>'9')f|=ch=='-',ch=getchar(); while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar(); x=f?-x:x; } inline int max(Re a,Re b){return a>b?a:b;} struct BIT{ int C[N]; inline void add(Re x,Re v){while(x<=n)C[x]=max(C[x],v),x+=x&-x;} inline int ask(Re l,Re r){ Re ans=0; while(l<=r){ while(r-(r&-r)>=l)ans=max(ans,C[r]),r-=r&-r; ans=max(ans,A[r--]); } return ans; } }TR; int main(){ in(n),in(T); for(Re i=1;i<=n;++i)in(A[i]),TR.add(i,A[i]); while(T--)in(x),in(y),printf("%d\n",TR.ask(x,y)); }