#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
const int dim=1e5+5;
int a[dim],n,q,dp[dim][25];
void precalc(){
    for(int i=0;i<n;i++){
        dp[i][0]=i;
    }
    for(int j=1;(1<<j)<=n;j++){
        for(int i=0;i+(1<<j)<=n;i++){
            if(a[dp[i][j-1]]<a[dp[i+(1<<(j-1))][j-1]]){
                dp[i][j]=dp[i][j-1];
            }
            else{
                dp[i][j]=dp[i+(1<<(j-1))][j-1];
            }
        }
    }
}
int query(int l, int r){
    int j=(int)log2(r-l+1);
    return min(a[dp[l][j]],a[dp[r-(1<<j)+1][j]]);
}
int main(){
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    cin>>n>>q;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    precalc();
    while(q--){
        int l,r;
        cin>>l>>r;
        cout<<query(l-1,r-1)<<'\n';
    }
    return 0;
}