#include <cstdio>

using namespace std;

long l,c[100100][20],n,i,j,p[100100],m,a,b,inf,k,rez;

int main(){
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%d%d",&n,&m);
inf=1000000000;
for (i=2;i<=n;i++)
    p[i]=p[i/2]+1;
for (i=1;i<=n;i++)
    for(j=0;j<=p[n];j++)
        c[i][j]=inf;
for (i=1;i<=n;i++)
    {
    scanf("%d",&l);
    c[i][0]=l;    
    }
for (k=0; k<=n; k++) 
    if ((1<<(k+1))>n) 
        break;
for (j=1;j<=k;j++)
    for (i=1;i<=n;++i)
        if ((i+(1<<j))<=n)
            {
            c[i][j]=c[i+(1<<(j-1))][j-1];
            if (c[i][j-1]<c[i][j])
                c[i][j]=c[i][j-1];
            }
for (i=1;i<=m;i++)
    {
    scanf("%d%d",&a,&b);
    l=p[b-a];
    rez=c[b-(1<<l)+1][l];
    if (c[a][l]<rez)
        rez=c[a][l];
    printf("%d\n",rez);
    }
return 0;
}