0pts

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


struct node{
	int l, r, sum;
}t[30000010];

int len;
int n, a[2000010];
int m, l, r, k;
int cnt;
int rt[2000010];

int v[200010];

struct awa
{
	int pos, val;
}b[200010];

bool cmp(awa a, awa b)
{
	if(a.val != b.val) return a.val < b.val;
	return a.pos < b.pos;
 } 

void dsc()
{
	for(int i = 1; i <= n; i++)
	{
		b[i] = {i, a[i]};
	}
	sort(b + 1, b + n + 1, cmp);
	for(int i = 1; i <= n; i++)
	{
		v[b[i].pos] = i;
	}
	return;
}

int buildtree(int id, int l, int r)
{
	id = ++cnt;
	if(l == r)
	{
		t[id].sum = 0;
		return id;
	}
	int mid = (l + r) >> 1;
	t[id].l = buildtree(t[id].l, l, mid);
	t[id].r = buildtree(t[id].r, mid + 1, r);
	return id;
}

int newnode(int p)
{
	t[++cnt] = t[p];
	return cnt;
}

int change(int id, int l, int r, int x, int val)
{
	id=newnode(id);
	if(l == r)
	{
		t[id].sum += val;
	}
	else
	{
		t[id].sum += val;
		int mid = (l + r) >> 1;
		if(x <= mid)
		{
			t[id].l = change(t[id].l, l, mid, x, val);
		}
		else
		{
			t[id].r = change(t[id].r, mid + 1, r, x, val);
		}
	}
	return id;
}

int query(int id1, int id2, int l, int r, int x)
{
	if(l == r)
	{
		return l;
	}
	int mid = (l + r) >> 1, lsum = t[t[id2].l].sum - t[t[id1].l].sum;
	if(x <= lsum)
	{
		query(t[id1].l, t[id2].l, l, mid, x);
	}
	else
	{
		query(t[id1].r, t[id2].r, mid + 1, r, x - lsum);
	}
}

signed main()
{
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i]; 
	}
	
	dsc();
	
	rt[0] = buildtree(1, 1, n);
	for(int i = 1; i <= n; i++)
	{
		rt[i] = change(rt[i - 1], 1, n, v[i], 1);
	}
	
	
	for(int i = 1; i <= m; i++)
	{
		cin >> l >> r >> k;
		cout << b[query(rt[l - 1], rt[r], 1, n, k)].val << '\n';
	}
	return 0;
}