#include <stdio.h>
int i,j,k,n,m,min,p,q;
int rmq[100010][20];
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);

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

    for (i=1; i<=n; i++)
    {
        scanf("%d",&k);
        rmq[i][0]=k;
    }

    for (k=0; k<=n; k++) if ((1<<(k+1))>n) break;

    for (j=1; j<=k; j++)
    {
        p=(1<<j);
        for (i=1; i<=n; i++)
        {
            min=rmq[i][j-1];
            if (i+p<=n && rmq[i+(p>>1)][j-1]<min) min=rmq[i+(p>>1)][j-1];
            rmq[i][j]=min;
        }
    }

    for (i=1; i<=m; i++)
    {
        scanf("%d %d",&p,&q);
        for (k=0; k<=n; k++)
            if ((1<<(k+1))>q-p) break;

        min=rmq[p][k];
        if (rmq[q-(1<<k)+1][k]<min) min=rmq[q-(1<<k)+1][k];
        printf("%d\n",min);
    }

    
    return 0;
}