#include <iostream>
#include <fstream>
#include <ctgmath>

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

int rmq[22][100005];

int main() {
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        fin >> rmq[0][i];
    }

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

    int a, b;
    for (int i = 0; i < m; ++i) {
        fin >> a >> b;
        int x = log2(b - a + 1);
        fout << std :: min(rmq[x][a], rmq[x][b - (1 << x) + 1]) << '\n';
    }
    return 0;
}