#include <fstream>
#include <cmath>
#define fq 100002

using namespace std;

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

int n,q,l,r,i,j;
int RMQ[20][fq];

int query(int l,int r)
{
    int lg=(int)log2(r-l+1);
    return min(RMQ[lg][l],RMQ[lg][r-(1<<lg)+1]);
}

int main()
{
    fin>>n>>q;
    for(i=1; i<=n; i++)
        fin>>RMQ[0][i];

    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<=q; i++)
    {
        fin>>l>>r;
        fout<<query(l,r)<<'\n';
    }
    return 0;
}