#include <fstream>

using namespace std;
int n, m, st, dr;
int d[20][100010];
int p[100010];

int main() {
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        fin >> d[0][i];
    }
    p[1] = 0;
    for (int i = 2; i <= n; i++) {
        p[i] = p[i / 2] + 1;
    }
    for (int e = 1; (1 << e) <= n; e++) {
        for (int i = 1; i <= n; i++) {
            d[e][i] = d[e - 1][i];
            int j = i + (1 << (e - 1));
            if (j <= n && d[e][i] > d[e - 1][j]) {
                d[e][i] = d[e - 1][j];
            }
        }
    }

    for (int i = 1; i <= m; i++) {
        fin >> st >> dr;
        int e = p[dr - st + 1];
        dr = dr - (1 << e) + 1;
        fout << min(d[e][st], d[e][dr]) << "\n";
    }
    return 0;
}