#include<cstdio>
#include<algorithm>
using namespace std;

const int N=100005;
const int logN=30;

int dp[N][logN+1];
int log[logN+1];
int n,m;

void init(){
	for (int i=2;i<=n;i++){
		log[i]=log[i/2]+1;
	}
	return ;
}

int main(){
//	freopen("P3865_4.in","r",stdin);
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++) scanf("%d",&dp[i][0]);
	init();
	int logn=log[n];
	for (int j=1;j<=logn+1;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++){
		int l,r;
		scanf("%d%d",&l,&r);
		int s=log[r-l+1];
		printf("%d\n",max(dp[l][s],dp[r-(1<<s)+1][s]));
	}
	return 0;
}

https://www.luogu.com.cn/record/199697612