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

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

int main()
{
fin>>m>>q;
logaritm = log2(m);
puteri[0] = 1;
while(puteri[i] <= m){
    puteri[++i] = puteri[i] * 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 - 1) / logaritm;
    if((st - 1) % logaritm != 0)
        val1++;
    val2 = dr / logaritm;
    Min = 1000005;
    Min = rmq[val1+1][val2-val1-1];
    for(j=st;j<=puteri[val1 + 1]-2;j++){
        Min = min(Min,v[j]);
    }
    for(j=puteri[val2];j<=dr;j++){
        Min = min(Min,v[j]);
    }
    if(Min == 0){
        Min = 1000005;
        for(j=st;j<=dr;j++){
            Min = min(Min,v[j]);
        }
    }
    fout << Min << '\n';

}

    return 0;
}