#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;

int n,a[100005],b[100005][20];

void rmq ()
{
    int i,j;
    for (i=1; i<=n; i++)
        b[i][0]=i;
    for (j=1; (1<<j)<=n; j++)
        for (i=1; i+(1<<j)-1<=n; i++)
            if (a[b[i][j-1]] < a[b[i+(1<<(j-1))][j-1]] )
                b[i][j]=b[i][j-1];
            else b[i][j]=b[i+(1<<(j-1))][j-1];
}

int main ()
{
    int i,m,k,x,y;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (i=1; i<=n; i++)
        scanf("%d",&a[i]);
    rmq();
    for (i=1; i<=m; i++)
    {
        scanf("%d%d",&x,&y);
        k=log10(y-x+1)/log10(2);
        printf("%d\n",min(a[b[x][k]],a[b[y-(1<<k)+1][k]]));
    }
    return 0;
}