POJ 2104

//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <cstring>
#include <stack>
#include <list>
#include <cstdlib>
#include <bitset>
#include <deque>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <cctype>
#include <ctime>

#define lowbit(x) (x&(-x))
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

#define sp system("pause")

const int MAXN = 1e5 + 6;

int n, m, cnt, root[MAXN], a[MAXN], x, y, k;
vector<int>v;

int id(int x)
{
	return lower_bound(v.begin(), v.end(),x) - v.begin() + 1;
}
struct node
{
	int l, r, sum;
	node(int ll = 0, int rr = 0, int ss = 0)
	{
		l = ll, r = rr, sum = sum;
	}
}T[MAXN*40];

void update(int l, int r, int &x, int y, int tar)
{
	T[++cnt] = T[y], T[cnt].sum++, x = cnt;
	if (l == r)return;
	int mid = (l + r) >> 1;
	if (tar <= mid)update(l, mid, T[x].l, T[y].l, tar);
	else update(mid + 1, r, T[x].r, T[y].r, tar);
}

int query(int l, int r, int x, int y, int pos)
{
	if (l == r)return l;
	int mid = (l + r) >> 1;
	int sum = T[T[y].l].sum - T[T[x].l].sum;
	if (sum >= pos)return  query(l ,mid,T[x].l,T[y].l,pos);
	else return query(mid + 1, r, T[x].r, T[y].r, pos - sum);
}

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)scanf("%d", &a[i]), v.push_back(a[i]);
	sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());
	for (int i = 1; i <= n; i++)update(1, n, root[i], root[i - 1], id(a[i]));
	for (int i = 1; i <= m; i++)
	{
		scanf("%d%d%d", &x, &y, &k);
		printf("%d\n", v[query(1, n, root[x - 1], root[y], k) - 1]);
	}
}