#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[100005][20];
int n,m,a,b,dif,p,poz,sol;

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+(1<<i)-1<=n;j++){
            rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
        }
    }

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

    for(int i=1;i<=m;i++){
        f>>a>>b;
        dif = (b-a)+1;
        poz = a;
        sol = INT_MAX;

        p=0;
        while(dif>=(1<<p)){
            p++;
        }

        while(dif!=0){

            while(dif<(1<<p)){
                p--;
            }

            sol = min(sol,rmq[p][poz]);
            poz+=(1<<p);

            dif-=(1<<p);
        }

        g<<sol<<'\n';
    }

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