#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e6+10;
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;
}
int Log_[MAXN];
int a[MAXN],f[MAXN][21];
int main(){
	int n,m;
	Log_[0]=-1;
	n=read();m=read();
	for(int i=1;i<=n;i++){
		f[i][0]=read();
		Log_[i]=Log_[i>>1]+1;
		}
	for(int j=1;j<=log2(n);j++)
		for(int i=1;i+(1<<j)-1<=n;i++)
			f[i][j]=max(f[i][j-1],f[i+(1<<(j-1))][j-1]);
		for(int i=1;i<=m;i++){
			int l,r,len;
			cin>>l>>r;
			len=r-l+1;
			int j=Log_[len];
			cout<<max(f[l][j],f[r-(1<<j)+1][j])<<endl;
		}
	return 0;
	}