#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

const int maxn = 1e5 + 10;
int n, m, x, op, tot, root, a[maxn];
struct npde {
	int l, r, rd, val, size;
} t[maxn];
struct query {
	int l, r, k, id, ans;
} q[maxn];
void push_up(int now) {
	t[now].size = t[t[now].l].size + t[t[now].r].size + 1;
	return ;
}
void spilt(int now, int key, int &x, int &y) {
	if (now) {
		if (t[now].val <= key) {
			x = now;
			spilt(t[now].r, key, t[now].r, y);
		} else {
			y = now;
			spilt(t[now].l, key, x, t[now].l);
		}
		push_up(now);
	} else x = y = 0;
	return ;
}
int merge(int x, int y) {
	if (x && y) {
		if (t[x].rd <= t[y].rd) {
			t[x].r = merge(t[x].r, y);
			push_up(x);
			return x;
		} else {
			t[y].l = merge(x, t[y].l);
			push_up(y);
			return y;
		}
	}
	return x + y;
}
int new_node(int key) {
	tot++;
	t[tot].l = t[tot].r = 0;
	t[tot].val = key;
	t[tot].size = 1;
	t[tot].rd = rand();
	return tot;
}
void insert(int key) {
	int x, y;
	spilt(root, key, x, y);
	root = merge(merge(x, new_node(key)), y);
	return ;
}
void del(int key) {
	int x, y, z;
	spilt(root, key, x, y);
	spilt(x, key - 1, x, z);
	z = merge(t[z].l, t[z].r);
	root = merge(merge(x, z), y);
	return ;
}
int get_key(int now, int k) {
	int cnt = t[t[now].l].size + 1;
	if (cnt == k) return t[now].val;
	else if (cnt < k) return get_key(t[now].r, k - cnt);
	return get_key(t[now].l, k);
}
bool cmp(query x, query y){
	return x.l < y.l;
}
bool cmp_rank(query x, query y){
	return x.id < y.id;
}
int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%d", a + i);
	for (int i = 1; i <= m; i++){
		scanf("%d %d %d", &q[i].l, &q[i].r, &q[i].k);
		q[i].id = i;
	}
	sort(q + 1, q + m + 1, cmp);
	insert(a[1]);
	for (int l = 1, r = 1, now = 1; now <= m; now++) {
		while (l < q[now].l) del(a[l++]);
		while (r < q[now].r) insert(a[++r]);
		q[now].ans = get_key(root, q[now].k);
	}
	sort(q + 1, q + m + 1, cmp_rank);
	for (int now = 1; now <= m; now++) printf("%d\n", q[now].ans);
	return 0;
}