#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int r[17][100010];
int E[100010];
int n, m, i, j, st, dr, minim, p, e, len;
int main()
{
    fin>>n>>m;
    for(i=1; i<=n; i++)
    {
        fin>>r[0][i];
    }
    for(p=1;(1<<p)<=n;p++){
        for(i=1;i<=n;i++){
            r[p][i]=r[p][i-1];
            j=i+(1<<(p-1));
            if(j<=n&&r[p][i]>r[p][i-1]){
                r[p][i]=r[p-1][j];
            }
        }
    }
    E[1]=0;
    for(i=2;i<=n;i++){
        E[i]=E[i/2]+1;
    }
    for(i=1; i<=m; i++)
    {
        fin>>st>>dr;
        e=E[st-dr+1];
        len=(1<<e);
        fout<<min(r[e][st],r[e][dr-len+1])<<"\n";
    }
    return 0;
}