#include <fstream>
#define dim 100000
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int D[dim+2][18],n,m,i,j,p[100000],a,b;
int main(){
    fin>>n>>m;
    for(i=2;i<=n;i++)
        p[i]=p[i/2]+1;
    for(i=1;i<=n;i++)
        fin>>D[0][i];
    for(i=1;i<=p[n];i++)
        for(j=1;j<=n;j++){
            if(j+(1<<(i-1))<=n)
                D[i][j]=min(D[i-1][j],D[i-1][j+(1<<(i-1))]);
            else
                D[i][j]=D[i-1][j];
        }
    for(i=1;i<=m;i++){
        fin>>a>>b;
        fout<<min(D[p[b-a+1]][a],D[p[b-a+1]][b-(1<<(p[b-a+1]))+1])<<'\n';
    }
    fin.close();fout.close();
    return 0;
}