#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
int a[10000000],n,m;
int p[10000000][25];
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
	while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
void st(){
	for(int i=1;i<=n;i++)p[i][0]=read();
	for(int j=1;(1<<j)<=n;j++){
		for(int i=1;i<=n+1-(j<<1);i++){
			p[i][j]=max(p[i][j-1],p[i+(1<<(j-1))][j-1]);
		}
	}
}
int query(int l,int r){
	int k=int(log(r-l+1)/log(2.0));
	return max(p[l][k],p[r-(1<<k)+1][k]);
}
int main(){
	cin >>n>>m;
	st();
	for(int i=1;i<=m;i++){
		int L=read(),R=read();
		int ans=0;
		ans=query(L,R);
		cout <<ans<<endl;
	}
	return 0;
}