#include <iostream>
#include <fstream>

#define MAX_SIZE 1000
#define LG_N 20


int main() {
    std::ifstream input("rmq.in");
    std::ofstream output("rmq.out");

    int n, m;
    int a[MAX_SIZE] = {0};
    int rmq[LG_N][MAX_SIZE] = {0};
    int log[MAX_SIZE] = {0};

    input >> n >> m;

    for (int i = 0; i < n; ++i) input >> a[i];

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

    for (int i = 0; i < n; ++i) {
        rmq[0][i] = a[i];
    }

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

    while (m--) {
        int x, y;
        input >> x >> y;
        x--, y--;
        int k = log[y - x + 1];
        int min = std::min(rmq[k][x], rmq[k][y + 1 - (1 << k)]);
        output << min << '\n';
    }

    return 0;
}