#include<bits/stdc++.h>
using namespace std;
int n,m,logs[1000010],dp[1000010][110],ans[1000010],top,x,y,s;
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%d",&dp[i][0]);
	}
	for(int i=2;i<=n;i++){
	    logs[i]=logs[i>>1]+1;
	}
	for(int j=1;(1<<j)<=n;j++){
		for(int i=1;i+(1<<(j-1))<=n;i++){
			dp[i][j]=max(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
		}
	}
	for(int i=1;i<=m;i++){
		scanf("%d%d",&x,&y);
		s=logs[y-x+1];
		ans[++top]=max(dp[x][s],dp[y-(1<<s)+1][s]);
	}
	for(int i=1;i<=top;i++){
		printf("%d\n",ans[i]);
	}
	return 0;
}