#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int N = 2e5+5;
const int NODES = 22*N;

int n, q, a[N];
int roots[N], nodes = 0;
int lc[NODES], rc[NODES], cnt[NODES];
vector<int> vals;

int update(int p, int l, int r, int k) {
    int id = ++nodes;
    lc[id] = lc[p]; rc[id] = rc[p];
    cnt[id] = cnt[p] + 1;
    if (l == r) return id;
    int mid = (l + r) >> 1;
    if (k <= mid) lc[id] = update(lc[p], l, mid, k);
    else rc[id] = update(rc[p], mid + 1, r, k);
    return id;
}

int query(int L, int R, int l, int r, int x) {
    if (l == r) return l;
    int cntL = cnt[lc[R]] - cnt[lc[L]];
    int mid = (l + r) >> 1;
    if (x <= cntL) return query(lc[L], lc[R], l, mid, x);
    return query(rc[L], rc[R], mid + 1, r, x - cntL);
}

void solve() {
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        vals.push_back(a[i]);
    }
    sort(vals.begin(), vals.end());
    vals.erase(unique(vals.begin(), vals.end()), vals.end());
    int m = vals.size();
    roots[0] = 0;
    for (int i = 1; i <= n; i++) {
        a[i] = lower_bound(vals.begin(), vals.end(), a[i]) - vals.begin() + 1;
        roots[i] = update(roots[i - 1], 1, m, a[i]);
    }
    while (q--) {
        int l, r, k; cin >> l >> r >> k;
        int p = query(roots[l - 1], roots[r], 1, m, k);
        cout << vals[p - 1] << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int tests = 1; // cin >> tests;
    while (tests--) solve();

    #ifdef LOCAL
    cerr << "\nTime elapsed: " << clock() << " ms.\n";
    #endif
    return 0;
}