#include <bits/stdc++.h>
using namespace std;

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

int main() {
    int n, q; fin >> n >> q;
    vector<vector<int>> dp(log2(n) + 1, vector<int>(n + 1));
    for (int i = 1; i <= n; i++)
        fin >> dp[0][i];

    for (int i = n - 1; i >= 1; i--)
        for (int j = 1; i + (1 << j) - 1 <= n; j++)
            dp[j][i] = min(dp[j - 1][i], dp[j - 1][i + (1 << (j - 1))]);

    auto rmq = [&](int left, int right) {
        int len = right - left + 1;
        int log = log2(len);
        return min(dp[log][left], dp[log][right - (1 << log) + 1]);
    };

    for (int i = 0; i < q; i++) {
        int x, y; fin >> x >> y;
        fout << rmq(x, y) << '\n';
    }

    fout.close();
    return 0;
}