#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,p[100001],m,a,b,d[20][100000],i,j,P;
int main(){
    fin>>n>>m;
    for(i=1;i<=n;i++){
        fin>>d[0][i];
    }
    for(i=2;i<=n;i++){
        p[i]=1+p[i/2];
    }
    for(i=1;i<=p[n]+1;i++){
        for(j=1;j<=n;j++){
            d[i][j]=min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
        }
    }
    for(i=1;i<=m;i++){
        fin>>a>>b;
        P=p[b-a+1];
        fout<<min(d[P][a],d[P][b-(1<<P)+1])<<"\n";
    }




    return 0;
}