#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int NMAX=1e5, LOGMAX=5;
struct rmq{
    vector<vector<int> > mat;
    vector<int> lg;
    rmq(vector<int>& v, int n)
        :mat(LOGMAX+15, vector<int>(n+5)), lg(n+5)
        {
            lg[1]=0;
            for(int i=2;i<=n;i++){
                lg[i]=lg[i/2]+1;
            }
            for(int i=1;i<=n;i++){
                mat[0][i]=i;
            }
            build(v, n);
        }
    void build(vector<int> &v, int n){
        for(int i=1;i<=lg[n];i++){
            for(int j=1;j+(1<<i)-1<=n;j++){
                if(v[mat[i-1][j]]<=v[mat[i-1][j+(1<<(i-1))]]){
                    mat[i][j]=mat[i-1][j];
                }else{
                    mat[i][j]=mat[i-1][j+(1<<(i-1))];
                }
            }
        }
    }
    int query(int L, int R, vector<int>& v){
        int dist=lg[R-L+1];
        return min(v[mat[dist][L]], v[mat[dist][R-(1<<dist)+1]]);
    }
};
int main(){
    int n, q;
    fin>>n>>q;
    vector<int> v(n+1);
    for(int i=1;i<=n;i++){
        fin>>v[i];
    }
    rmq ans(v, n);
    for(int i=1;i<=q;i++){
        int l, r;
        fin>>l>>r;
        fout<<ans.query(l,r,v)<<'\n';
    }
}