The sum

Input

The first line contains two integers $n$ and $k$ (1 \le n \le 10^5,\ 0 \le k \le 10^5) — the number of elements in the array and the number of queries.

Each of the following $k$ lines contains one query of the following types:

• A~l~r~x — assign the value $x$ to every element with indices from $l$ to r~(1 \le l \le r \le n, 0 \le x \le 10^9);

• $Qlr$ — find the sum of array elements with indices from $l$ to r~(1 \le l \le r \le n).

Initially, the array is filled with zeros.

Output

For each query of the form $Qlr$, print the sum of numbers on the corresponding segment.

Examples