#include <fstream>

#define NMAX 100005
#define LOG 20

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int n, questions, x, y;
int v[NMAX], sparseTable[LOG][NMAX];

void getSparseTable() {

    for (int i = 1; (1 << i) <= n; i++) {

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

int getRmq(int x, int y) {
    int log = 0;
    int length = y - x + 1;

    while ((1 << log) < length) {
        log++;
    }
    log--;

    return min(sparseTable[log][x], sparseTable[log][y -  (1 << log) + 1]);
}

int main()
{
    f >> n >> questions;

    for (int i = 1; i <= n; i++) {
        f >> v[i];
        sparseTable[0][i] = v[i];
    }

    getSparseTable();

    while (questions--) {
        f >> x >> y;
        g << getRmq(x, y) << "\n";
    }

    return 0;
}