MKTHNUM - K-th Number

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[1 ... n] 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[i ... j] 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[2 ... 5] 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.

Input

The first line of the input contains n — the size of the array, and m — the number of questions to answer (1 ≤ n ≤ 100000, 1 ≤ m ≤ 5000).

The second line contains n different integer numbers not exceeding 10^9 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, and k (1 ≤ i ≤ j ≤ n, 1 ≤ k ≤ j - i + 1) and represents the question Q(i, j, k).

Output

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

Example

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

Output:
5
6
3

Note: a naive solution will not work!!!


Added by:psetter
Date:2009-02-24
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO
Resource:Northeastern Europe 2004 Northern Subregion

hide comments
2017-10-24 22:26:38 newbie
finally accepted,
A few tips:
1. numbers can be +ve, -ve and 0.
2. Use Fast I/O Got many tle because of that.

Thanks to @harsh_jain1 for giving the hint that it can be solved using trie also.
2017-08-13 21:29:57 AAKASH TYAGI
O( log^3 n ) per query works fine. Just remember to binary search on array elements rather than the entire range.
2017-08-10 19:43:35
Solved using trie...wow!!
2017-06-24 12:52:52


Last edit: 2018-02-21 13:49:34
2017-06-16 21:59:13 Eddy Cael
Hint: Maybe you will need to solve KQUERY first. using Segment Trees of course.
2017-06-14 18:08:50 shubham
Qlog^3(n) doesn't work with fast input.. TLE
2017-06-14 13:35:00
Did you know that naive solution of 'tourist' was accepted.
2017-06-12 08:35:20
took me 2 days to learn the concept of persistent tree,finally AC :) in one go.
read the tutorial of anudeep on persistent segment tree again and again and you will get the concept.
After it must try the CLONEME problem on Codechef.
2017-06-11 13:44:39
why O((n + m)log^2(n)) doesn't get tle?
2017-06-08 22:44:19
persistent segment tree...amazing DS :D
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.