#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn=1e5+5;
int a[maxn],f[maxn][100];
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;
}

int rmq(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();
		f[i][0]=a[i];
	}
	
	for(int j=1;(1<<j)<=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 a=read(),b=read();
		cout<<rmq(a,b)<<endl;
	}
	
	return 0;
}