#include <fstream>
#include <algorithm>

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

int const nmax = 100000;
int const aintdim = 4 * nmax + 10;
int aint[aintdim];

void update (int nod, int st, int dr, int poz, int val) {
    if (st == dr) {
        aint[nod] = val;
        return;
    }
    int med = (st + dr) >> 1;
    if (poz <= med)
        update ((nod << 1), st, med, poz, val);
    else
        update (((nod << 1) + 1), med + 1, dr, poz, val);
    aint[nod] = std::min(aint[(nod << 1)], aint[((nod << 1) + 1)]);
}

int query (int nod, int st, int dr, int l, int r) {
    if (l <= st && dr <= r)
        return aint[nod];
    int med = (st + dr) >> 1;
    if (r <= med)
        return query ((nod << 1), st, med, l, r);
    else if (med + 1 <= l)
        return query (((nod << 1) + 1), med + 1, dr, l, r);
    return std::min(query ((nod << 1), st, med, l, r), query (((nod << 1) + 1), med + 1, dr, l, r));
}

int main() {
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        int x;
        fin >> x;
        update (1, 1, n, i, x);
    }
    while (m--) {
        int x, y;
        fin >> x >> y;
        fout << query (1, 1, n, x, y) << "\n";
    }
    return 0;
}