The organizers of the Lemon Cup are planning to prepare prizes for the contest. There are $N$ types of prizes in total, and each type is numbered from $1$ to $N$. Initially, the quantity of every prize is $0$.

Jaewon wants to use these prizes to create gift bundles. A single gift bundle must contain two or more consecutively numbered prizes, and exactly one prize of each included type is used.

The following two types of queries are given.

• 1 l r k: Purchase $k$ items for each of the prizes numbered $l, l + 1, \cdots, r$. However, if $k < 0$, it means $$ items of each corresponding prize have been discarded.

Every time a type 2 query is given, print the answer of the query.

The input is given in the following format.

$N \ Q$ $\text{query}_1$ $\text{query}_2$

Every time a type 2 query is given, print the answer of the query, separated by new line.

• $1 \leq N \leq 200\ 000$.
• $1 \leq Q \leq 200\ 000$.
• $1\le l_i\le$ ().