Given an array of $n$ integers, your task is to process $q$ queries of the following types:

update the value at positionktouwhat is the minimum value in range[a,b]?

The first input line has two integers $n$ and $q$ : the number of values and queries.

The second line has $n$ integers $x_1,x_2,\dots,x_n$ : the array values.

Finally, there are $q$ lines describing the queries. Each line has three integers: either " $1$ $k$ $u$ " or " $2$ $a$ $b$ ".

• $1 \le n,q \le 2 \cdot 10^5$
• $1 \le x_i, u \le 10^9$
• $1 \le k \le n$
• $1 \le a \le b \le n$

Print the result of each query of type 2.