h2. Date de intrare

Input file $arraycounting.in$ will contain three integers, $n$, $q$ and $k$, which represent the length of the array, the number of queries we need to process and the minimal threshold for the value of each number with respect to the second type of query ($1 \le n \le 5 * 10^4$), ($1 \le q \le 2 * 10^5$), ($1 \le k \le 20$).

Input file $arraycounting.in$ will contain three integers, $n$, $q$ and $k$, which represent the length of the array, the number of queries we need to process and the minimal threshold for the value of each number with respect to the second type of query.

The second line of the input will contain the initial array $v$ ($1 \le v_i \le 100$).

The second line of the input will contain the initial array $v$.

The next $q$ lines of the input will contain the description of the queries. For queries of type $1$, ($1 \le a \le n$), ($1 \le b \le 100$). For queries of type $2$, ($1 \le l \le r \le n$), ($1 \le s \le 2 * 10^6$).
 
For tests worth $20$ points, ($1 \le n \le 20$).
 
For tests worth $40$ additional points, ($1 \le n \le 2000$, $1 \le q \le 5000$).

The next $q$ lines of the input will contain the description of the queries.
For queries of type $1$, ($1 \le a \le n$), ($1 \le b \le 100$). For queries of type $2$, ($1 \le l \le r \le n$), ($1 \le s \le 2 * 10^6$).

h2. Date de ieşire

h2. Restricţii

* $... ≤ ... ≤ ...$

* $1 ≤ n ≤ 5 * 10^4$
* $1 ≤ q ≤ 2 * 10^5$
* $1 ≤ k ≤ 20$
* $1 ≤ v[i], b ≤ 100$
* $1 ≤ a, l, r ≤ n$
* $1 ≤ s ≤ 2 * 10^6$
* For tests worth $20$ points, $1 ≤ n ≤ 20$.
* For tests worth $40$ additional points, $1 ≤ n ≤ 2000$, $1 ≤ q ≤ 5000$.

h2. Exemplu