#include <bits/stdc++.h>
using namespace std;

int main() {
    ifstream in("rmq.in");
    ofstream out("rmq.out");

    int n, m, rmq[100001][18], log[100001];
    in >> n >> m;
    for (int i = 1; i <= n; ++i)
        in >> rmq[i][0];

    log[1] = 0;
    for (int i = 2; i <= n; ++i)
        log[i] = log[i / 2] + 1;

    for (int j = 1; (1 << j) <= n; ++j)
        for (int i = 1; i <= n + 1 - (1 << j); ++i)
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);

    for (int i = 1; i <= m; ++i) {
        int st, dr, l, poz;
        in >> st >> dr;
        l = dr - st + 1;
        poz = log[l];
        out << min(rmq[st][poz], rmq[dr + 1 - (1 << poz)][poz]) << '\n';
    }

    return 0;
}