#include <stdio.h>

int a[19][100001],i,j,n,m,lg[100001],x,y,l;
int main(void)
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (i=1;i<=n;i++)
        scanf("%d",&a[0][i]);
    for (i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for (j=1;(1<<j)<=n;j++)
    {
        for (i=1;i+(1<<j)-1<=n;i++)
        {
            l=1<<(j-1);
            if (a[j-1][i]>a[j-1][i+l])
                a[j][i]=a[j-1][i+l];
            else a[j][i]=a[j-1][i];
        }
    }
    for (i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        j=lg[y-x+1];
        l=y-(1<<j)+1;
        if (a[j][x]>a[j][l])
            printf("%d\n",a[j][l]);
        else printf("%d\n",a[j][x]);
    }
    return 0;
}