Given an array of $n$ integers, your task is to process $q$ queries of the following types:
update the value at positionktouwhat is the maximum prefix sum 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$ ".
Print the result of each query of type 2.
8 4 1 2 -1 3 1 -5 1 4 2 2 6 1 4 -2 2 2 6 2 3 4· \n · · · · · · · \n · · \n · · \n · · \n · · \n
5 2 0\n \n \n