#include<fstream>
#include <iostream>

#define ll long long
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int N, M, Log2[100002], m[20][100002];

void logaritm() {
    //calculez log2 din numerele de la 1 la n
    for (int i = 2; i <= N; ++i)
        Log2[i] = Log2[i / 2] + 1;
}

void proces() {
    for (int i = 1; (1 << i) < N; ++i)
        for (int j = 1; j + (1 << i) - 1 <= N; ++j)
            m[i][j] = min(m[i - 1][j], m[i - 1][j + (1 << (i - 1))]); // impart intervalul si stabilesc min
}

void query(int s, int d) {
    int len = Log2[d - s + 1];
    fout << min(m[len][s], m[len][d - (1 << len) + 1]) << '\n'; //caut minimul din intervalul dat
}

int main() {
    fin >> N >> M;
    for (int i = 1; i <= N; ++i)
        fin >> m[0][i]; //completam prima linie cu valorile initiale

    logaritm();
    proces();

    for (int i = 1; i <= M; ++i) {
        int s, d;
        fin >> s >> d;
        query(s, d);
    }

    return 0;
}