Change on the Segment Junior

You are given a set of $N$ integers: $a_0$, $a_1$, ..., $a_{N-1}$, all initially set to $0$. You will receive a series of modification and output requests.

For a modification request, you will be provided with three integers: $l$, $r$, and $d$. You need to add the value $d$ to each element $a_i$ where $l\le i\le r$.

For an output request, you will be given a single integer $i$. You need to output the current value of the element $a_i$.

Input Format

The first line contains three integers: $N$, $MA$, and $MQ$. These represent the number of elements, the number of modification requests, and the number of output requests, respectively.

The following $MA+MQ$ lines contain the requests. Each modification request is formatted as "$A$, $l$, $r$, $d$", and each output request is formatted as "$Q$, $i$".

All numbers are integers with the following constraints: $1\le N\le 10^6$, $0\le MA,MQ\le 10^6$, $0\le l\le r<N$, $0\le i<N$, and $|d|\le 10^3$. It is guaranteed that at least one of the numbers $N$, $MA$, or $MQ$ will not exceed $50$.

Output Format

For each output request, print the current value of the specified element on a new line.

Examples