#include <bits/stdc++.h>

#define dim 100001
#define DIM 17


using namespace std;

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

int n, m;
int v[dim], w[dim][DIM];

void rmq() {
    for (int j = 1; (1 << j) <= n; j++) {
        for (int i = 0; i + (1 << j)-1 <= n; i++) {
            if (v[w[i][j - 1]] < v[w[i + (1 << (j - 1))][j - 1]])
                w[i][j] = w[i][j - 1];
            else
                w[i][j] = w[i + (1 << (j - 1))][j - 1];
        }
    }
}

int query(int x, int y) {
    int ind = log2(y - x + 1);
    return min(v[w[x][ind]], v[w[y - (1 << ind) + 1][ind]]);
}

int main() {

    in >> n >> m;

    for (int i = 1; i <= n; i++) {
        in >> v[i];
        w[i][0] = i;
    }

    rmq();

    while (m--) {
        int x, y;
        in >> x >> y;
        out << query(x, y) << '\n';
    }

    return 0;
}