#include <iostream>
#include <fstream>
#include <cmath>
#define NMAX 100005
#define LOGMAX 17
#include <algorithm>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");
/*
d[j][i] - minimul din secventa care incepe la i si are lungimea 2^j (rotated storage)
*/
int n,m,st,dr,v[NMAX], d[NMAX][LOGMAX+1], lg[NMAX];
void preprocess (){
    lg[1]=0;
    for (int j=1; j<=n; ++j){
        d[j][0]=v[j];
        if (j!=1) {
            lg[j]=lg[j/2]+1;
        }
    }
    for (int i=1; i<=lg[n]; ++i){
        for (int j=1; j+(1<<i)-1 <=n; ++j){
            d[j][i]=min(d[j][i-1], d[j + (1 << (i - 1))][i-1]);
        }
    }
}
int RMQ(int st,int dr){
    int aux=lg[dr-st+1];
    return min(d[st][aux], d[dr - (1 << aux) + 1][aux]);
}
int main() {
    fin >> n >> m;

    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
    }
    preprocess();
    for (int i = 1; i <= m; ++i) {
        fin >> st >> dr;
        fout << RMQ(st,dr)<<'\n';
    }

    return 0;
}