#include <fstream>
#include <cmath>

using namespace std;

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

const int LGMAX = 17;
const int NMAX = 1e5 + 1;

int n, q;
int a[NMAX];
int rmq[LGMAX][NMAX];
int lg[NMAX];

inline void read() {
    fin >> n >> q;
    for (int i = 1; i <= n; ++i) {
        fin >> a[i];
    }
}

inline void preProcess() {
    for (int i = 2; i <= n; ++i)
        lg[i] = lg[i / 2] + 1;

    for (int i = 1; i <= n; ++i)
        rmq[0][i] = a[i];
}

inline void getRMQ() {
    int len;
    for (int i = 1; (1 << i) <= n; ++i) {
        for (int j = 1; j <= n - (1 << i) + 1; ++j) {
            len = 1 << (i - 1);
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + len]);
        }
    }
}

inline void solve() {
    int x, y, d, rem, len;
    for (int i = 1; i <= q; ++i) {
        fin >> x >> y;
        d = y - x + 1;
        len = lg[d];
        rem = d - (1 << len);
        fout << min(rmq[len][x], rmq[len][x + rem]) << '\n';
    }
}

int main()
{
    read();
    preProcess();
    getRMQ();
    solve();

    fin.close();
    fout.close();
    return 0;
}