You are given array?a?with?n?integers and?m?queries. The?i-th query is given with three integers?l_i,?r_i,?x_i.

For the?i-th query find any position?p_i?(l_i?≤?p_i?≤?r_i) so that?a_pi?≠?x_i.

The first line contains two integers?n,?m?(1?≤?n,?m?≤?2·10⁵) — the number of elements in?a?and the number of queries.

The second line contains?n?integers?a_i?(1?≤?a_i?≤?10⁶) — the elements of the array?a.

Each of the next?m?lines contains three integers?l_i,?r_i,?x_i?(1?≤?l_i?≤?r_i?≤?n,?1?≤?x_i?≤?10⁶) — the parameters of the?i-th query.

Print?m?lines. On the?i-th line print integer?p_i?— the position of any number not equal to?x_i?in segment?[l_i,?r_i]?or the value??-?1?if there is no such number.