#include <fstream>

using namespace std;

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

const int Nmax=100002;
const int LOG=18;

int n,m,l,a,b;
int v[Nmax],r[Nmax][LOG],log[Nmax];

int minim ( int x , int y ){
    if ( x < y )
        return x;
    return y;
}

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

    for ( int i=1 ; i<=n ; i++ ){
        r[i][0]=v[i];
        for ( int j=1 ; ( 1 << j )<=i ; j++ )
            r[i][j]=minim(r[i][j-1],r[i-(1<<(j-1))][j-1]);
    }
    for ( int i=1 ; i<=m ; i++ ){
        fin>>a>>b;
        l=log[b-a+1];
        fout<<minim(r[b][l],r[a+(1<<l)-1][l])<<'\n';
    }


}