#include <stdio.h>
#include <stdlib.h>
#include <algorithm>

#define BUF_SIZE 16384
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi,*fo;
inline char nextch(){
    if(pbuf==BUF_SIZE){
        fread(buf, BUF_SIZE, 1, fi);
        pbuf=0;
    }
    return buf[pbuf++];
}
inline long long nextnum(){
    long long a=0;
    char c=nextch();
    while((c<'0' || c>'9') && c!='-')
        c=nextch();
    int semn=1;
    if(c=='-'){
        semn=-1;
        c=nextch();
    }
    while('0'<=c && c<='9'){
        a=a*10+c-'0';
        c=nextch();
    }
    return a*semn;
}

inline int min(int a, int b){
    return a < b ? a : b;
}

#define MAXN 100000

int lg[1+MAXN];
int v[1+MAXN];
int rmq[18][1+MAXN];
int main(){
    fi=fopen("rmq.in","r");
    fo=fopen("rmq.out","w");
    int n=nextnum(), m=nextnum();
    for(int i=1;i<=n;i++)
        v[i]=nextnum();

    lg[1]=0;
    for(int i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;

    for(int i=1;i<=n;i++)
        rmq[0][i]=v[i];
    for(int i=1;(1<<i)<=n;i++)
        for(int j=1;j<=n-(1<<i)+1;j++){
            int l=(1<<(i-1));
            rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+l]);
        }

    for(int i=0;i<m;i++){
        int a=nextnum(), b=nextnum();
        int diff=b-a+1;
        int l=lg[diff];
        int sh=diff-(1<<l);
        fprintf(fo,"%d\n", min(rmq[l][a], rmq[l][a+sh]));
    }
    fclose(fi);
    fclose(fo);
    return 0;
}