The array of $n$ elements is given. Find the sum of numbers on a segment. \InputFile The first line contains two integers $n$ and $k~(1 \le n ≤ 10^5, 0 ≤ k ≤ 10^5)$ --- the number of elements in array and the number of queries. The next $k$ lines contain the queries of two forms: \begin{itemize} \item $A~l~r~x$ --- assign the value of $x$ to each element form position $l$ to $r~(1 \le l \le r \le n, 0 \le x \le 10^9)$ \item $Q~l~r$ --- find the sum of array elements on positions from $l$ to $r~(1 \le l \le r \le n)$ \end{itemize} Initially the array is filled with zeroes. \OutputFile For each query of the form "$Q~l~r$" print the sum of numbers on a segment.