#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 = 0; i < n; i++){
        rmq[i][0] = i;
    }

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

}

int findNr(int x, int y){

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

}

int main()
{

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

}