#include <iostream>
#include <bits/stdc++.h>
int a[100005],dp[100005][100];
using namespace std;
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 main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        a[i]=read();
        dp[i][0]=a[i];
    }
    for(int j=1;1<<j<=n;j++)
    {
        for(int i=1;i+(1<<j)-1<=n;i++)
        {
            dp[i][j]=max(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
        }
    }
    for(int q=1;q<=m;q++)
    {
        int x,y;
        cin>>x>>y;
        int c=(int)log2(y-x+1);
        cout<<max(dp[x][c],dp[y+1-(1<<c)][c])<<endl;
    }
    return 0;
}