#include <fstream>
using namespace std;

ifstream in("rmq.in");

const int kNMax = 100005, kLgMax = 18;
int n, m, rmq[kLgMax][kNMax], lg[kNMax], v[kNMax];

void Citire() {
    in >> n >> m;
    for (int i = 1; i <= n; ++i)
        in >> rmq[0][i];
}

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

void PrecalculareRMQ() {
    int l;
    for (int i = 1; (1 << i) <= n; ++i)
        for (int j = 1; j <= n - (1 << i) + 1; ++j) {
            l = 1 << (i - 1);
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + l]);
    }
}

void Query () {
    ofstream out("rmq.out");
    int x, y, l, d, s;
    for (int i = 1; i <= m; ++i) {
        in >> x >> y;
        d = y - x + 1;
        l = lg[d];
        s = d - (1 << l);
        out << min(rmq[l][x], rmq[l][x + s]) << '\n';
    }
    in.close();
    out.close();
}

void Solve () {
    PrecalculareLg();
    PrecalculareRMQ();
    Query();
}


int main() {
    Citire();
    Solve();
    return 0;
}