#include <fstream>
#include <vector>

using namespace std;

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

int n, q;
vector<int> v, logs;
vector<vector<int>> sparse_table;
const int LOG_N = 20;

inline int operation(int st_idx_1, int st_idx_2) {
    return v[st_idx_1] <= v[st_idx_2] ? st_idx_1 : st_idx_2;
}

void precalculate_log_array() {
    logs[1] = 0;
    for (int i = 2 ; i <= n + 1 ; ++i) {
        logs[i] = logs[i / 2] + 1;
    }
}

void precalculate_sparse_table() {
    for (int i = 0 ; i <= n ; ++i) {
        sparse_table[0][i] = i;
    }
    for (int i = 1 ; i <= LOG_N ; ++i) {
        for (int j = 0 ; j + (1 << i) - 1 <= n ; ++j) {
            sparse_table[i][j] = operation(sparse_table[i - 1][j], sparse_table[i - 1][j + (1 << (i - 1))]);
        }
    }
}

int main() {
    cin >> n >> q;
    v.resize(n + 2);
    logs.resize(n + 2);
    sparse_table.resize(LOG_N + 2, vector<int>(n + 2));
    for (int i = 1 ; i <= n ; ++i) {
        cin >> v[i];
    }
    precalculate_log_array();
    precalculate_sparse_table();
    for (int i = 1 ; i <= q ; ++i) {
        int l, r;
        cin >> l >> r;
        int power_length = logs[r - l + 1];
        int interval_one_min = sparse_table[power_length][l];
        int interval_two_min = sparse_table[power_length][r - (1 << power_length) + 1];
        cout << v[operation(interval_one_min, interval_two_min)] << "\n";
    }
    return 0;
}