#include <bits/stdc++.h>

using namespace std;

const int MAX = 1e5 + 5;


int n, q;
pair<int, int> a[MAX];
int u[MAX], v[MAX], k[MAX];
int l[MAX], r[MAX];
int bit[MAX];

void update(int idx, int val) {
    for (; idx <= n; idx += idx & -idx) bit[idx] += val;
}

int query_bit(int idx) {
    int sum = 0;
    for (; idx > 0; idx -= idx & -idx) sum += bit[idx];
    return sum;
}

int get(int l, int r) {
    return query_bit(r) - query_bit(l - 1);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> q;

    for (int i = 1; i <= n; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a + 1, a + n + 1);

    for (int i = 1; i <= q; i++) {
        cin >> u[i] >> v[i] >> k[i];
        l[i] = 1; r[i] = n;
    }

    for (int t = 0; t < 20; t++) {
        vector<pair<int, int>> b;
        for (int i = 1; i <= q; i++) {
            if (l[i] < r[i]) {
                b.push_back({(l[i] + r[i]) / 2, i});
            }
        }

        if (b.empty()) break;

        sort(b.begin(), b.end());

        memset(bit, 0, sizeof bit);

        int j = 0, sz = b.size();

        for (int i = 1; i <= n; i++) {
            while (j < sz && b[j].first < i) {
                int id = b[j].second;
                if (get(u[id], v[id]) >= k[id])
                    r[id] = b[j].first;
                else l[id] = b[j].first + 1;
                j++;
            }
            update(a[i].second, 1);
        }

        while (j < sz) {
            int id = b[j].second;
            if (get(u[id], v[id]) >= k[id])
                r[id] = b[j].first;
            else l[id] = b[j].first + 1;
            j++;
        }
    }

    for (int i = 1; i <= q; i++) {
        cout << a[l[i]].first << "\n";
    }

    return 0;
}