#include <fstream>
#include <algorithm>

using namespace std;

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

const int NMAX = 100005;

int n, Q;
int rmq[20][NMAX];
int pw[NMAX];

int main() {
    fin >> n >> Q;
    for (int i = 1; i <= n; ++ i)
        fin >> rmq[0][i];

    // precalculare
    pw[1] = 0;
    for (int i = 2; i <= n; ++ i)
        pw[i] = 1 + pw[i >> 1];

    // RMQ
    int lg = pw[n];
    for (int i = 1; i <= lg; ++ i)
        for (int j = 1; j <= n - (1 << i) + 1; ++ j)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);

    for (int i = 1; i <= Q; ++ i) {
        int x, y;
        fin >> x >> y;
        int temp = pw[y - x + 1];
        fout << min(rmq[temp][x], rmq[temp][y + 1 - (1 << temp)]) << "\n";
    }


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