#include <iostream>
#include <fstream>
#define nmax 100001

using namespace std;

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

int E[nmax], n, m, x, y, j;
int r[17][nmax];
int main()
{
    fin>>n>>m;
    E[1]=0;

    for(int i=2; i<=n; i++){
        E[i]=E[i/2]+1;   //precalculam cea mai mare putere a lui 2 mai mica sau egala cu i
    }

    for(int i=1; i<=n; i++){
        fin>>r[0][i];
    }

    for(int p=1; p<=E[n]; p++){
        for(int i=1; i<=n; i++){
            j=1<<(p-1);
            if(i+j<=n)
                r[p][i]=min(r[p-1][i], r[p-1][i+j]);  //formam rmq
            else
                r[p][i]=r[p-1][i];
        }
    }

    for(int i=1; i<=m; i++){
        fin>>x>>y;
        j=y-x+1;
        fout<<min(r[E[j]][x], r[E[j]][y-(1<<E[j])+1])<<'\n';
    }

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