#include <fstream>
#include <iostream>

#define MAXN 100002
#define MAXLIN 17

using namespace std;

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

int N, M, NN, log[MAXN];
int rmq[MAXLIN][MAXN];

inline void Read() {
    fin >> N >> M;

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

inline void Range() {
    log[1] = 0;
    for (int i = 2; i <= N; i++)
        log[i] = log[i / 2] + 1;

    NN = log[N];

    for (int i = 1; i <= NN; i++) {
        for (int j = 1; j + (1 << (i - 1)) <= N; j++) {
            cout << (1 << (i - 1)) << "\n";
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
        }
    }
}

inline int Query(int x, int y) {
    int NN = log[y - x + 1];
    int auxi = 1 << NN;

    return min(rmq[NN][x], rmq[NN][y - auxi + 1]);
}

inline void Solve() {
    int x, y;

    while (M--) {
        fin >> x >> y;

        if (x > y)
            swap(x, y);

        fout << Query(x, y) << "\n";
    }
}

int main() {
    Read();
    Range();
    Solve();

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