#include<bits/stdc++.h>
using namespace std;
const int N=1e5;
int n;
int m;
long long dp[N][21];
int k;
int qmax(int l,int r)
{
	k=log2(r-l+1);
	return max(dp[l][k],dp[r-(1<<k)+1][k]);
}
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		dp[i][0]=read();
	}
	for(int j=1;j<=20;j++)
	{
		for(int i=1;i<=n;i++)
		{
			if(i+(1<<j)-1<=n)
				dp[i][j]=max(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
		}
	}
	int l,r;
	while(m--)
	{
		l=read();
		r=read();
		printf("%d\n",qmax(l,r));
	}
	return 0;
}