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