#include <fstream>
#define DIM 100001
using namespace std;
int n,q,i,j,k,val,x,y;
int d[20][DIM],p[DIM],l[DIM];
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");

int main (){

    fin>>n>>q;
    for (i=1;i<=n;i++)
        fin>>d[0][i];
    // calculam toate puterile de 2 mai mici sau egale cu n
    p[1] = 0;
    for (i=2;i<=n;i++)
        p[i] = 1+p[i/2];
    for (i=1;(1<<i)<=n;i++)
        for (j=1;j<=n;j++){
            //
            if (j+(i<<i) <= n)
                d[i][j] = min (d[i-1][j],d[i-1][j+(1<<(i-1))]);
        }

    for (i=1;i<=q;i++){
        fin>>x>>y;
        val = p[y-x+1];
        fout<<min (d[val][x],d[val][y-(1<<val)+1])<<"\n";
    }


    return 0;
}