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

}