#include<bits/stdc++.h>
using namespace std;
 
using ll = long long;
 
template<typename X, typename Y>
bool chmax(X& a, Y b) { return (a < b) ? a = b, 1 : 0; }
 
template<typename X, typename Y>
bool chmin(X& a, Y b) { return (a > b) ? a = b, 1 : 0; }
 
const int N = 2e5+5;
 
int n, q, a[N];
 
struct Node {
    int lc, rc, cnt;
} st[22*N];
 
int roots[N], nodes = 0;
 
int update(int p, int l, int r, int k) {
    int id = ++nodes;
    st[id] = st[p];
    st[id].cnt++;
    if (l == r) return id;
    int mid = (l + r) >> 1;
    if (k <= mid) st[id].lc = update(st[p].lc, l, mid, k);
    else st[id].rc = update(st[p].rc, mid + 1, r, k);
    return id;
}
 
int query(int L, int R, int l, int r, int k) {
    if (l == r) return l;
    int cnt = st[st[R].lc].cnt - st[st[L].lc].cnt;
    int mid = (l + r) >> 1;
    if (cnt >= k) return query(st[L].lc, st[R].lc, l, mid, k);
    return query(st[L].rc, st[R].rc, mid + 1, r, k - cnt);
}
 
void solve() {
    cin >> n >> q;
    vector<int> vals;
    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();
    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(false); cin.tie(NULL);
 
    int tests = 1; // cin >> tests;
    while (tests--) solve();
 
    #ifdef LOCAL
    cerr << "\nTime elapsed: " << clock() << ' ms.\n';
    #endif
    return 0;
}