rt

#include <bits/stdc++.h>
using namespace std;

int st[100001][31];
int lg[100001];
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++)
        st[i][0] = read();
    for(int i = 2;i <= n;i++)
        lg[i] = lg[i / 2]+1;
    for(int j = 1;(1<<j) <= n;j++)
        for(int i = 1;i + (1<<j-1) <= n;i++)
            st[i][j] = max(st[i][j-1],st[i + (1<<j-1)][j-1]);
    while(m--)
    {
        int l,r;
        cin >> l >> r;
        int k = lg[r - l];
        printf("%d\n",max(st[l][k],st[r - (1<<k)+1][k]));
    }
    return 0;
}