← 返回题目

题库练习 Destiny

← 上一题下一题 →

A11128 | $Destiny$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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 ![](/uploads/acgo/image/3636f180f6192e46_dc17459a77cb.jpeg) times or $-1$ if there is no such number. Help Leha with such a difficult task.

输入格式

First line of input data contains two integers $n$ and $q$ ( $1<=n,q<=3 \cdot 10^{5}$ ) — number of elements in the array and number of queries respectively. Next line contains $n$ integers $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=n$ ) — Leha's array. Each of next $q$ lines contains three integers $l$ , $r$ and $k$ ( $1<=l<=r<=n,2<=k<=5$ ) — description of the queries.

输出格式

Output answer for each query in new line.

输入输出样例

输入 #1

输出 #1

1
-1

输入 #2

输出 #2

2
1
2

C++ 编辑器

输入

输出