#include <fstream>
#include <algorithm>
#include <map>
using namespace std;

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

int n, m;
int a[1000005], rmq[18][1000005], e[1000005], pows[20];

void BuildSparseTable() {
    for (int i = 2; i <= n; i++) {
        e[i] = e[i / 2] + 1;
    }
    pows[0] = 1;
    for (int i = 1; i <= e[n]; i++) {
        pows[i] = (pows[i - 1] << 1);
    }

    for (int i = 1; i <= n; i++) {
        rmq[0][i] = a[i];
    }
    for (int i = 1; i <= e[n]; i++) {
        for (int j = 1; j <= n - pows[i] + 1; j++) {
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + pows[i - 1]]);
        }
    }
}

int Query(int st, int dr) {
    int length, expo;
    length = dr - st + 1;
    expo = e[length];

    return min(rmq[expo][st], rmq[expo][dr - pows[expo] + 1]);
}

int main() {
    int x, y;

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

    BuildSparseTable();

    for (int i = 1; i <= m; i++) {
        fin >> x >> y;

        fout << Query(x, y) << "\n";
    }
}