2918. K-th Number

单点时限: 2.0 sec

内存限制: 256 MB

You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able to return quickly k-th order statistics in the array segment.

That is, given an array a[1n] of different integer numbers, your program must answer a series of questions Q(i,j,k) in the form: “What would be the k-th number in a[ij] segment, if this segment was sorted?”
For example, consider the array a=(1,5,2,6,3,7,4). Let the question be Q(2,5,3). The segment a[25] is (5,2,6,3). If we sort this segment, we get (2,3,5,6), the third number is 5, and therefore the answer to the question is 5.

输入格式

The first line of the input file contains n — the size of the array, and m — the number of questions to answer (1n100 000,1m5 000).

The second line contains n different integer numbers not exceeding 109 by their absolute values — the array for which the answers should be given.

The following m lines contain question descriptions, each description consists of three numbers: i,j,k (1ijn,1kji+1)andrepresentsthequestionQ(i, j, k)$.

输出格式

For each question output the answer to it — the k-th number in sorted a[ij] segment.

样例

Input
7 3
1 5 2 6 3 7 4
2 5 3
4 4 1
1 7 3
Output
5
6
3

23 人解决,33 人已尝试。

36 份提交通过,共有 152 份提交。

5.2 EMB 奖励。

创建: 13 年,9 月前.

修改: 7 年,5 月前.

最后提交: 3 月,4 周前.

来源: Northeastern Europe 2004, Northern Subregion