#include <fstream>
#define MAX (int)(1e5+5)
#define LOGMAX 20
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n,q,lg[MAX],rmq[LOGMAX][MAX];

void read();
void solve();

int main(){
    read();
    solve();
    return 0;
}
void solve(){
    int i,x,y;
    while(q--){
        fin>>x>>y;
        fout<<min(rmq[lg[y-x]][x],
                  rmq[lg[y-x]][y-(1<<lg[y-x])+1])
            <<'\n';
    }
}
void read(){
    int i,j;
    fin>>n>>q;
    for(i=1;i<=n;++i){
        fin>>rmq[0][i];
    }
    //precalculate
    for(i=2;i<=n;++i)
        lg[i]=lg[i/2]+1;

    for(i=1;i<=lg[n];++i){
        for(j=1;j<=n;++j){
            rmq[i][j]=min(rmq[i-1][j],
                          rmq[i-1][j+(1<<(i-1))]);
        }
    }
}