#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[18][1000010], v[1000010];
int st,dr,len,i,j,n,m,k;
int main(){
fin>>n>>m;
for(i=1;i<=n;i++){
    fin>>a[0][i];
}
for(i=1;(1<<i)<=n;i++){
    for(j=1;j<=n;j++){
        a[i][j]=a[i-1][j];
        k=j+(1<<(i-1));
        if(k<=n&&a[i-1][k]<a[i][j]){
            a[i][j]=a[i-1][k];
        }
    }
}
for(i=2;i<=n;i++){
    v[i]=v[i/2]+1;
}
for(i=1;i<=m;i++){
    fin>>st>>dr;
    len=v[dr-st+1];
    fout<<min(a[len][st],a[len][dr-(1<<len)+1])<<"\n";
}
    return 0;
}