This problem is exactly the same as in the previous lesson, but this time try to solve it using the technique that was discussed in the lecture.

There is an array of $n$ elements, initially filled with zeros. You need to write a data structure that processes two types of queries:

• add to the segment from $l$ to $r−1$ the number $v$,
• find the current value of element $i$.

The first line contains two numbers $n,m\ (1≤n,m≤100,000)$, the size of the array and the number of operations. 

The following lines contain the description of the operations. The description of each operation is as follows:

• 1 l r v: add the value $v$ to the segment from $l$ to $r−1\ (0≤l<r≤n,\ 0≤v≤10^9)$.
• 2 i: find the value of the element with index $i\ (0≤i<n)$.

For each operation of the second type, print the corresponding value.