You come home and fell some unpleasant smell. Where is it coming from?

You are given an array a. You have to answer the following queries:

1. You are given two integers l and r. Let c_i be the number of occurrences of i in a_l: r, where a_l: r is the subarray of a from l-th element to r-th inclusive. Find the Mex of {c₀, c₁, ..., c_10⁹}
2. You are given two integers p to x. Change a_p to x.

The Mex of a multiset of numbers is the smallest non-negative integer not in the set.

Note that in this problem all elements of a are positive, which means that c₀ = 0 and 0 is never the answer for the query of the second type.

The first line of input contains two integers n and q (1 ≤ n, q ≤ 100 000) — the length of the array and the number of queries respectively.

The second line of input contains n integers — a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹).

Each of the next q lines describes a single query.

The first type of query is described by three integers t_i = 1, l_i, r_i, where 1 ≤ l_i ≤ r_i ≤ n — the bounds of the subarray.

The second type of query is described by three integers t_i = 2, p_i, x_i, where 1 ≤ p_i ≤ n is the index of the element, which must be changed and 1 ≤ x_i ≤ 10⁹ is the new value.

For each query of the first type output a single integer  — the Mex of {c₀, c₁, ..., c_10⁹}.