#include <fstream>
#define DEF 100001
#define DEF2 20

using namespace std;

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

int log2[DEF], D[DEF2][DEF], n, m;

void construct () {
    for (int i = 1; (1 << i) <= n; ++ i) {
        for (int j = 1; j <= n; ++ j) {
            if ((1 >> (i - 1)) <= n)
                D[i][j] = min (D[i - 1][j], D[i - 1][j + (1 << (i - 1))]);
            else
                D[i][j] = D[i - 1][j];
        }
    }
}

int querry (int x, int y) {
    return min (D[log2[y - x + 1]][x], D[log2[y - x + 1]][y - (1 << (log2[y - x + 1])) + 1]);
}

int main () {
    log2[1] = 0;
    for (int i = 2; i <= n; ++ i) {
        log2[i] = 1 + log2[i / 2];
    }

    fin >> n >> m;
    for (int i = 1; i <= n; ++ i) {
        fin >> D[0][i];
    }
    construct ();
    for (int i = 1; i <= m; ++ i) {

        int x, y;
        fin >> x >> y;
        fout << querry (x, y) << "\n";
    }
    return 0;
}