#include <fstream>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int n,m,i,p,st,dr,j,r[20][100000],lg,e,b[100000];
int main()
{
    fin>>n>>m;
    for (i=1; i<=n; i++)
        fin>>r[0][i];
    for (p=1; (1<<p)<=n; p++)
    {
        for (i=1; i<=n; i++)
        {
            r[p][i]=r[p-1][i];
            j=i+(1<<(p-1));
            if (j<=n&&r[p-1][j]<r[p][i])
                r[p][i]=r[p-1][j];
        }
    }
    for (i=2; i<=n; i++)
        b[i]=b[i/2]+1;
    for (i=1; i<=m; i++)
    {
        fin>>st>>dr;
        e=b[dr-st+1];
        lg=(1<<e);
        fout<<min (r[e][st],r[e][dr-lg+1])<<"\n";
    }
    return 0;
}