#include<stdio.h>

FILE *fin=fopen("rmq.in","r"),
    *fout=fopen("rmq.out","w");

int N,K,M[100005][20],a[100005];
int log[100005];
inline int min(int x,int y){
    if(x<y) return x;
    return y;
}

int main(){
    fscanf(fin,"%d %d",&N,&K);

    log[0]=-1;

    for(int i=1;i<=N;i++){
        fscanf(fin,"%d",&a[i]);
        M[i][0]=i;
        log[i]=log[i/2]+1;
    }


    for(int j=1;1<<j <=N;j++)
        for(int i=1;i+(1<<j)-1<=N;i++)
            if(a[M[i][j-1]]<=a[M[i+(1<<(j-1))][j-1]])
                M[i][j]=M[i][j-1];
            else
                M[i][j]=M[i+(1<<(j-1))][j-1];


    int i,j,l,nr1,nr2;
    for(int k=1;k<=K;k++){

        fscanf(fin,"%d %d",&i,&j);

        l=log[j-i+1];
        nr1=a[M[i][l]];
        nr2=a[M[j-(1<<l)+1][l]];

        fprintf(fout,"%d\n",min(nr1,nr2));
    }


    fclose(fin);
    fclose(fout);
    return 0;
}