#include<cstdio>
#include<algorithm>
using namespace std;
int n,m,i,j,lg[50001],a[20][50001],l,x,y;
int main()
{
    freopen("saracsaurege.in","r",stdin);
    freopen("saracsaurege.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(i=1;i<=n;++i)
    scanf("%d",&a[0][i]);
    lg[1]=0;
    for(i=2;i<=n;++i)
    lg[i]=lg[i/2]+1;

    for(i=1;(1<<i)<=n;++i)
    for(j=1;j<=n-(1<<i)+1;++j)
    a[i][j]=max(a[i-1][j],a[i-1][j+(1<<i-1)]);

    for(i=1;i<=m;++i)
    {
        scanf("%d %d",&x,&y);
        l=lg[y-x+1];
        printf("%d\n",max(a[l][x],a[l][y+1-(1<<l)]));
    }
    return 0;
}