#include <fstream>

#define NMAX 100005
#define LOG 20

using namespace std;

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

int n, questions, a, b;
int 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 RMQ(int a, int b) {
    int length = b - a + 1;
    int log = 0;

    while ((1 << log) <= length)
        log++;
    log--;

    return min(sparseTable[log][a],
               sparseTable[log][b - (1 << log) + 1]);
}

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

    getSparseTable();

    while (questions--) {
        f >> a >> b;

        g << RMQ(a, b) << "\n";
    }

    return 0;
}