#include <bits/stdc++.h>
#define FUG fin.close(); fout.close(); exit(0);
using namespace std;

string const& task("rmq");
ifstream fin((task + ".in").c_str());
ofstream fout((task + ".out").c_str());

int const N(1e5 + 5), LN(17);
int rmq[LN][N], l2[N], p2[LN], n, m;

inline void Init() {
    p2[0] = 1;
    for (int i = 1; i < LN; ++i)
        p2[i] = p2[i-1] * 2;
    for (int i = 2; i < N; ++i)
        l2[i] = l2[i/2] + 1;
}
inline void BuildRMQ() {
    for (int l = 1; l < LN; ++l)
        for (int i = 1; i + p2[l] - 1 < N; ++i)
            rmq[l][i] = min(rmq[l-1][i], rmq[l-1][i+p2[l-1]]);
}
inline int Query(int const& x, int const& y) {
    int dif = y - x + 1, l = l2[dif];
    return min(rmq[l][x], rmq[l][y-p2[l]+1]);
}

signed main() {

    Init();
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
        fin >> rmq[0][i];
    BuildRMQ();
    while (m--) {
        int x, y;
        fin >> x >> y;
        fout << Query(x, y) << '\n';
    }

    FUG
}