Beads

A game is played by putting beads into boxes. The full rules are too long to repeat here. Only one thing matters for the outcome: you have to keep track of how many beads sit in a run of adjacent boxes.

A friend asked you to write a program that helps him win every game. At the start of a game every box is empty.

The first line contains $T$, the number of games played. Each game begins with a line holding $B$, $P$ and $Q$: the number of boxes, the number of put requests, and the number of query requests.

Then follow $P + Q$ lines. Each line is either P i a, meaning $a$ beads are put into box $i$, or Q i j, asking how many beads are in boxes $i$ through $j$ at that moment. Both end boxes belong to the range.

• $0 < T \le 100$
• $0 < B \le 100000$
• $0 < P \le 30000$
• $0 < Q \le 30000$
• $0 \le a \le 100$
• In P i a, $0 < i \le B$.
• In Q i j, $0 < i \le j \le B$.
• Boxes are numbered from 1.
• The input and the output are large. Read the input through a buffered reader and collect the whole output before writing it once.

For each query request, print the total number of beads in boxes $i$ through $j$ at that point of the game, one number per line.