#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int Nmax=100000+5;
int n,m,lg,minim;
int a[Nmax],rmq[20][Nmax],l[Nmax];
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;++i)fin>>a[i];
    for(int i=2;i<=n;++i)l[i]=l[i/2]+1;
    for(int i=1;i<=n;++i)rmq[0][i]=a[i];
    for(int pd=1;pd<=l[n];++pd)
         for(int i=1;i<=n-(1<<pd)+1;++i)
            rmq[pd][i]=min(rmq[pd-1][i],rmq[pd-1][i+(1<<(pd-1))]);
    for(int i=1,x,y;i<=m;++i)
    {
        fin>>x>>y;
        lg=l[y-x+1];
        minim=min(rmq[lg][x],rmq[lg][y-(1<<lg)+1]);
        fout<<minim<<'\n';
    }
    return 0;
}