#include <fstream>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n,m,i,j,p,v[20][100001];

int main(){
    fin>>n>>m;

    for(i=1;i<=n;i++){
        fin>>v[0][i];
    }

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

    for(;m;m--){
        fin>>i>>j;

        p=0;
        while((1<<p)<=j-i+1)
            p++;
        p--;

        fout<<min(v[p][i],v[p][j-(1<<p)+1])<<"\n";
    }

    return 0;
}