Given an array of $n$ integers, your task is to process $q$ queries of the following types:
increase each value in range[a,b]byuwhat is the value at positionk?
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$ $a$ $b$ $u$ " or " $2$ $k$ ".
Print the result of each query of type 2.
8 3 3 2 4 5 1 1 5 3 2 4 1 2 5 1 2 4· \n · · · · · · · \n · \n · · · \n · \n
5 6\n \n