#include <fstream>
#define N_max 100001
using namespace std;
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
int rmq[30][N_max],n,m;
int E[N_max];
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;++i) cin>>rmq[0][i];
    for(int p=1;(1<<p)<=n;++p)
    {
        for(int i=1;i<=n;++i)
        {
            rmq[p][i]=rmq[p-1][i];
            int aux=i+(1<<(p-1));
            if(aux<=n && rmq[p-1][aux]<rmq[p][i]) rmq[p][i]=rmq[i-1][aux];
        }
    }
    E[1]=0;
    for(int i=2;i<=n;++i)
        E[i]=1+E[i/2];
    while(m--){
        int s,d;
        cin>>s>>d;
        int e=E[d-s+1];
        int len=(1<<e);
        cout<<min(rmq[e][s],rmq[e][d-len+1])<<'\n';
    }
}