#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[i][j] - minimul din secventa care incepe la i si are lungimea 2^j

*/
int n,m,st,dr,v[NMAX], d[LOGMAX+1][NMAX], lg[NMAX];
void preprocess (){
    lg[1]=0;
    for (int j=1; j<=n; ++j){
        d[0][j]=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[i][j]=min(d[i-1][j], d[i - 1][j + (1 << (i - 1))]);
        }
    }
}
int RMQ(int st,int dr){
    int min1, min2;
    int aux=lg[dr-st+1];
    min1=d[aux][st];
    min2 = d[aux][dr - (1 << aux) + 1];
    return min(min1,min2);
}
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;
        cout << RMQ(st,dr)<<'\n';
    }

    return 0;
}