#include <bits/stdc++.h>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int logg = 15;
//modif logg
int v[100005],rmq[10005][18],i,j,n,q,p,st,dr,lungime,put=1,logaritm,m,val1,val2,Min=1000005;

int main()
{
fin>>m>>q;
p = 1;
while(p <= m){
    logaritm++;
    p <<= 1;
}
logaritm--;
//m atentie
for(i=1;i<=m;i++){
    fin>>v[i];
    Min = min(Min,v[i]);
    if(i % logaritm == 0){
        n++;
        rmq[n][0] = Min;
        Min=1000005;
    }
}
for(p=1;p<=logg;p++){
    for(i=1;i<=n;i++){
        if(i+put <= n){
        rmq[i][p] = min(rmq[i][p-1],rmq[i+put][p-1]);
        }
    }
    put <<= 1;
}
for(i=1;i<=q;i++){
    fin>>st>>dr;
    val1 = st / logaritm + 2;
    val2 = dr / logaritm;
    if(st % logaritm == 0)
        val1--;
    Min = 1000005;
    lungime = val2 - val1 + 1;
    p = 0;
    put = 1;
    while(put <= lungime){
        p++;
        put <<= 1;
    }
    p--;
    put >>= 1;
    Min = min(rmq[val1][p],rmq[val2-put+1][p]);
    for(j=st;j<=val1 * logaritm;j++){
        Min = min(Min,v[j]);
    }
    for(j=val2 * logaritm;j<=dr;j++){
        Min = min(Min,v[j]);
    }
    fout << Min << '\n';
}

    return 0;
}