#include <stdio.h>
int M[100000][17],n,m,log[100001];

int min(int x,int y){
    return x<y?x:y; }

void process(){
    int i,j;
    for(i=2;i<=n;i++)log[i]=log[i/2]+1;
        for(j=1;1<<j<=n;j++)
            for(i=0;i+(1<<j)-1<n;i++)
            M[i][j]=min(M[i][j-1],M[i+(1<<(j-1))][j-1]);
}

void read_data(){
    int i,x,y,k,rmq;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
        scanf("%d%d",&n,&m);
            for(i=0;i<n;i++)scanf("%d",&M[i][0]);
            process();
        for(i=1;i<=m;i++){
            scanf("%d%d",&x,&y);
                x--;y--;
                k=log[y-x+1];
                rmq=min(M[x][k],M[y-(1<<k)+1][k]);
            printf("%d\n",rmq);
        }
}

int main(){
    read_data();
}