#include <fstream>
using namespace std;

ifstream in { "rmq.in" };
ofstream out { "rmq.out" };

const int N_MAX = 100005;
const int LOG2_MAX = 18;

int N, M;
int RMQ[LOG2_MAX][N_MAX];
int log2[N_MAX];

int main() {
    in >> N >> M;
    for (int i = 1; i <= N; ++i)
        in >> RMQ[0][i];

    log2[0] = log2[1] = 0;
    for (int i = 2; i < N_MAX; ++i)
        log2[i] = log2[i / 2] + 1;

    for (int i = 1; (1 << i) <= N; ++i)
        for (int j = 1; j + (1 << (i - 1)) <= N; ++j)
            RMQ[i][j] = min(RMQ[i - 1][j], RMQ[i - 1][j + (1 << (i - 1))]);

    while (M--) {
        int x, y;
        in >> x >>y;

        int d = y - x + 1;
        int ld = log2[d];

        out << min(RMQ[ld][x], RMQ[ld][y - (1 << ld) + 1]) << '\n';
    }
}