#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int f[100010][40];
int a[100010];
int n,m;
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_kind() {
	for(int i=1; i<=n; i++) f[i][0]=a[i];
	int t=log(n)/log(2)+1;
	for(int j=1; j<=n; j++)
		for(int i=1; i<=n-(1<<j)+1; i++)
			f[i][j]=max(f[i][j-1],f[i+(1<<(j-1))][j-1]);
}
int ST_ans(int l,int r) {
	int k = log(r-l+1)/log(2);
	return max(f[l][k],f[r-(1<<k)+1][k]);
}
int main() {
	n=read();
	m=read();
	for(int i=1; i<=n; i++)
	{
		a[i]=read();
	}
	ST_kind();
	for(int i=1;i<=m;i++)
	{
		int l1,r1;
		l1=read();
		r1=read();
		cout<<ST_ans(l1,r1)<<endl;
	}
	return 0;
}