#include <fstream>


using namespace std;
int n,m,r[21][100001],E[100001];
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int main(){
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        fin>>r[0][i];
    for(int i=2;i<=n;i++)
        E[i]=E[i/2]+1;
    for(int p=1;(1<<p)<=n;p++)
        for(int i=1;i<=n;i++){
            r[p][i]=r[p-1][i];
            int j  = i + (1<<(p-1));
            if(j<=n && r[p-1][j]<r[p][i])
                r[p][i]=r[p-1][j];
    }
    while(m--){
        int st,dr; fin>>st>>dr;
        if(st>dr)
            swap(st,dr);
        int e = E[dr-st+1];
        int len = (1<<e);
        fout<<min(r[e][st],r[e][dr-len+1])<<'\n';
    }
    return 0;
}