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

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

const int MAXN = 1e5, log_MAXN = 17;
int N, M;
int rmq[log_MAXN][MAXN];  // rmq[k][i] = minim de pe interval i -> i + 2^k - 1

int main() {
    fin >> N >> M;
    for (int i = 1; i <= N; ++i)
        fin >> rmq[0][i];
    for (int p = 1; (1 << p) <= MAXN; ++p) {
        for (int i = 1; i + (1 << (p - 1)) <= N; i++) {
            rmq[p][i] = min(rmq[p - 1][i], rmq[p - 1][i + (1 << (p - 1))]);
        }
    }
    int a, b;
    while (M--) {
        fin >> a >> b;
        int len = b - a + 1;
        // int p = 0;
        // while ((1 << (p + 1)) <= len) ++p;
        int p = 31 - __builtin_clz(len);
        // cerr << "query rmq[" << p << "][" << a << "] rmq[" << p << "][" << (b - (1 << p) + 1) << "]\n";
        fout << min(rmq[p][a], rmq[p][b - (1 << p) + 1]) << '\n';
    }
    return 0;
}