#include<fstream>
#include<algorithm>
using namespace std;

const int NMAX=100005;
int his_his[20][NMAX],sssarpe[NMAX];

int main(){
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    int n,m;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        fin>>his_his[0][i];
    for(int p=2,s=1;p<=n;p*=2,s++)
        for(int ss=1;ss+p-1<=n;ss++)
            his_his[s][ss]=min(his_his[s-1][ss], his_his[s-1][ss+p/2]);
    for(int sserpulet=2,codita=2;sserpulet<=NMAX-5;sserpulet++){
        if(codita==sserpulet){
            sssarpe[sserpulet]=sssarpe[sserpulet-1]+1;
            codita*=2;
        }
        else
            sssarpe[sserpulet]=sssarpe[sserpulet-1];
    }
    for(int i=1;i<=m;i++){
        ///query
        int x,y,log;
        fin>>x>>y;
        log=sssarpe[y-x];
        fout<<min(his_his[log][x], his_his[log][y-(1<<log)+1])<<'\n';
    }
    return 0;
}