The array of n elements is given. Find the sum of numbers on a segment.
The first line contains two integers n and k (1≤n≤105,0≤k≤105) — the number of elements in array and the number of queries. The next k lines contain the queries of two forms:
A l r x — assign the value of x to each element form position l to r (1≤l≤r≤n,0≤x≤109)
Q l r — find the sum of array elements on positions from l to r (1≤l≤r≤n)
Initially the array is filled with zeroes.
For each query of the form "Q l r" print the sum of numbers on a segment.