4082: Destiny
内存限制：256 MB
时间限制：2 S
题面：传统
评测方式：文本比较
上传者：
提交：1
通过：1
题目描述
D. Destiny
time limit per test
2.5 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output
Once, Leha found in the left pocket an array consisting of n integers, and in the right pocket q queries of the form l r k. If there are queries, then they must be answered. Answer for the query is minimal x such that x occurs in the interval l r strictly more than 
times or -1 if there is no such number. Help Leha with such a difficult task.
times or -1 if there is no such number. Help Leha with such a difficult task.
Input
First line of input data contains two integers n and q (1≤n,q≤3·105) − number of elements in the array and number of queries respectively.
Next line contains n integers a1,a2,...,an (1≤ai≤n) − Leha's array.
Each of next q lines contains three integers l, r and k (1≤l≤r≤n,2≤k≤5) − desc
Output
Output answer for each query in new line.
Examples
Input
4 2 1 1 2 2 1 3 2 1 4 2
Output
1 -1
Input
5 3 1 2 1 3 2 2 5 3 1 2 3 5 5 2
Output
2 1 2
输入样例 复制
输出样例 复制