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

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

int st[18][100005];

int main() {
    int n, m;
    fin >> n >> m;

    for (int i = 1; i <= n; i++) {
        fin >> st[0][i];
    }

    // st[k][i] = minimul pe intervalul de lungime 2^k care incepe la i
    for (int k = 1; (1 << k) <= n; k++) {
        for (int i = 1; i + (1 << k) - 1 <= n; i++) {
            st[k][i] = min(
                st[k - 1][i],
                st[k - 1][i + (1 << (k - 1))]
            );
        }
    }

    while (m--) {
        int x, y;
        fin >> x >> y;

        int len = y - x + 1;

        int k = 0;
        while ((1 << (k + 1)) <= len) {
            k++;
        }

        int ans = min(
            st[k][x],
            st[k][y - (1 << k) + 1]
        );

        fout << ans << '\n';
    }

    return 0;
}