#include <fstream>
#define DEF 100002
#define DEF2 20

using namespace std;

ifstream fin ("rmq.in");
ofstream fout ("rmq.out");

int log2[DEF], D[DEF2][DEF], n, m, x, y, l;

int main () {
    fin >> n >> m;
    for (int i = 1; i <= n; ++ i) {
        fin >> D[0][i];
    }

    for (int i = 1; (1 << i) <= n; ++ i) {
        for (int j = 1; j <= n; ++ j) {
            if ((1 >> (i - 1)) <= n)
                D[i][j] = min (D[i - 1][j], D[i - 1][j + (1 << (i - 1))]);
            else
                D[i][j] = D[i - 1][j];
        }
    }

    log2[1] = 0;

    for (int i = 2; i <= n; ++ i) {
        log2[i] = 1 + log2[i / 2];
    }

    for (int i = 1; i <= m; ++ i) {
        fin >> x >> y;
        l = log2[y - x + 1];
        fout << min (D[l][x], D[l][y - (1 << l) + 1]) << '\n';
    }

    return 0;
}