#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int n,m,rmq[100003][18],i,j,x,y,aux,k,lg[100003];

int main()
{
    f>>n>>m>>aux; rmq[0][1]=aux;
    for(i=2;i<=n;++i)
        {f>>aux;rmq[0][i]=aux;lg[i]=lg[i/2]+1;}


    for(i=1;(1<<i)<=n;++i)
        for(j=1;j<=n-(1<<i)+1;++j)
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);

    for(i=1;i<=m;++i)
        {f>>x>>y;
        k=lg[y-x+1];
        g<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<'\n';}

    f.close();g.close();
    return 0;
}