#include <bits/stdc++.h>

using namespace std;
const int LOGMAX=17,NMAX=5e5;
int rmq[LOGMAX][NMAX+1],logof[NMAX+1],n;
void build_rmq(){
    int i,p;
    for(p=1;(1<<p)<=n;p++){
        for(i=1;i+(1<<p)-1<=n;i++){
            rmq[p][i]=min(rmq[p-1][i],rmq[p-1][i+(1<<(p-1))]);
        }
    }
    logof[1]=0;
    for(i=2;i<=n;i++){
        logof[i]=logof[i/2]+1;
    }
}
int print(int a, int b){
    int log1=logof[b-a+1];
    return min(rmq[log1][a],rmq[log1][b-(1<<log1)+1]);
}
int main(){
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    int m,i,a,b;
    fin>>n>>m;
    for(i=1;i<=n;i++){
        fin>>rmq[0][i];
    }
    build_rmq();
    for(i=1;i<=m;i++){
        fin>>a>>b;
        fout<<print(a,b)<<"\n";
    }
    return 0;
}