#include<fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,a,b,x,l,i,j;
int L[100005],D[18][100005];
int main(){
    fin>>n>>m;
    L[1]=0;
    for(i=2;i<=n;i++){
        L[i]=L[i/2]+1;
    }
    for(i=1;i<=n;i++){
        fin>>D[0][i];
    }
    for(i=1;i<=L[n];i++){
        for(j=1;j<=n;j++){
            D[i][j]=D[i-1][j];
            if(j+(1<<(i-1))<=n){
                D[i][j]=min(D[i][j],D[i-1][j+(1<<(i-1))]);
            }
        }
    }
    for(i=1;i<=m;i++){
        fin>>a>>b;
        l=L[b-a+1];
        fout<<min(D[l][a],D[l][b-(1<<l)+1])<<"\n";
    }
    return 0;
}