#include<fstream>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<climits>
#include<iomanip>
#include<cstring>
#include<bitset>
using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

//ifstream f("in.in");
//ofstream g("out.out");

int rmq[20][100005];
int n,m,a,b,p;

int main(){

    f>>n>>m;

    for(int i=1;i<=n;i++){
        f>>rmq[0][i];
    }

    for(int i=1;(1<<i)<=n;i++){
        for(int j=1;j<=n;j++){
            rmq[i][j] = rmq[i-1][j];

            int l = j+(1<<(i-1));

            if(l <= n && rmq[i-1][l] < rmq[i][j])
                rmq[i][j] = rmq[i-1][l];
        }
    }

    /*for(int i=0;(1<<i)<=n;i++){
        for(int j=1;j<=n;j++){
            cout<<rmq[i][j]<<" ";
        }
        cout<<'\n';
    }*/

    for(int i=1;i<=m;i++){
        f>>a>>b;

        p=0;
        while((b-a)+1>=(1<<p)){
            p++;
        }
        p--;

        //cout<<p<<'\n';

        g<<min(rmq[p][a],rmq[p][b-(1<<p)+1])<<'\n';
    }

    f.close();
    g.close();
    return 0;
}