#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

#define nmax 100010
#define logmax 17

int n,m,st,dr,k;
int rmq[logmax][nmax];
int log[nmax];

int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; i++)
        fin>>rmq[0][i];
    for(int i=2; i<=n; i++)
        log[i]=log[i>>1]+1;

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

    int l;
    for(int i=1; i<=m; i++)
    {
        fin>>st>>dr;
        l=log[dr-st+1];
        fout<<min(rmq[l][st],rmq[l][dr-(1<<l)+1])<<'\n';
    }

    fin.close();
    fout.close();
    return 0;
}