#include <fstream>
#include <math.h>
using namespace std;

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

const int nmax = 1e5;
const int lmax = 18;

int rmq[nmax+2][lmax];
int v[nmax+10];
int n,k;

void construire(){
    int i,j;
    for(i = 1; i <= n; i++){
        rmq[i][1] = i;
    }

    for(j = 2; 1<<(j-1)<=n; j++){
        for(i = 1; (i+(1<<(j-1))-1)<= n; i++){
            if(v[rmq[i][j-1]] <= v[rmq[i+(1<<(j-2))][j-1]]){
                rmq[i][j] = rmq[i][j-1];
            }
            else rmq[i][j] = rmq[i+(1<<(j-2))][j-1];
        }
    }

}

int findNr(int x, int y){

    int j = floor(log2(y-x+1));
    return min(v[rmq[x][j+1]], v[rmq[y-(1<<(j))+1][j+1]]);

}

int main()
{

    fin>>n>>k;
    int i;
    for(i = 1; i <= n; i++){
        fin>>v[i];
    }
    construire();
    int x,y;
    for(i = 1; i <= k; i++){
        fin>>x>>y;
        fout<<findNr(x,y)<<"\n";
    }

}