#include <cstdio>

using namespace std;

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

long min(long a, long b)
    {
    if (a<b)
        return a;
    else
        return b;    
    }

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