#include <stdio.h>
#include <vector>

using namespace std;

#define NMAX 50001
#define LMAX 12

long int rmq[NMAX][LMAX];
long int n,m;
long int *lg;
long int a[NMAX];

int main()
{
    freopen("saracsaurege.in","r",stdin);
    freopen("saracsaurege.out","w",stdout);

    long int i,j,l;

    scanf("%ld %ld",&n,&m);

    for (i=1;i<=n;i++)
        scanf("%ld ",&a[i]);


    for (i=1;i<=n;i++)
        rmq[0][i]=a[i];

    for (i=1; (1 << i) <=n;i++)
        for (j=1;j <= n - (1 << i)+1;j++)
        {
        l=1<<(i-1);
        rmq[i][j]= max( rmq[i-1][j] , rmq[i-1][j+l] );
        }

    long int x,y,diff,sh;
    scanf("%ld %ld",&x,&y);
    diff=y-x+1;
    lg=new long int [diff+1];
    lg[1]=0;
    for (i=2;i<=diff;i++)
        lg[i]=lg[i/2]+1;
    l=lg[diff];
    sh=diff - (1<<l);
    printf("%ld\n",max(rmq[l][x],rmq[l][x+sh]) );
    for (i=2;i<=m;i++)
    {
        scanf("%ld %ld",&x,&y);
        diff=y-x+1;
        l=lg[diff];
        sh=diff - (1<<l);
        printf("%ld\n",max(rmq[l][x],rmq[l][x+sh]) );
    }
    return 0;
}