#include<iostream>
#include<fstream>
#include<vector>
#define inf 1e5+1
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int NMAX1=100001;
const int NMAX2=317;
int rmq[NMAX2][NMAX1];
int neareastPow2[NMAX1];
vector<int>v;

void precalc(int &n){
    int cnt=0;
    int pow2=2;
    neareastPow2[1] = 0;
    for(int i=2;i<=n;++i){
        if(i==pow2){
            cnt++;
            pow2*=2;
        }
        neareastPow2[i]=cnt;
    }
    for(int i=0;i<n;++i){
        rmq[0][i]=v[i];
    }
    for(int pow=1;(1<<pow)<=n;++pow){
        for(int i=0;i<n;++i){
            if(i+(1<<pow)<=n){
                rmq[pow][i]=min(rmq[pow-1][i],rmq[pow-1][i+ (1<<(pow-1))]);
            }
        }
    }
   // cout<<"TEST"<<endl;
}
int solveQuery(int st,int dr){
    int dif=dr-st+1;
    int msb=neareastPow2[dif];
    return min(rmq[msb][st],rmq[msb][dr-(1<<msb)+1]);
}
int main(){
    int n,m;
    fin>>n>>m;
    v.resize(n);
    for(int i=0;i<n;++i){
        fin>>v[i];      
    }
    precalc(n);
    int st,dr;
    for(int i=0;i<m;++i){
        fin>>st>>dr;
        fout<<solveQuery(st-1,dr-1)<<"\n";
    }
    return 0;
}
//(=^..^=)