HORRIBLE - Horrible Queries


World is getting more evil and it's getting tougher to get into the Evil League of Evil. Since the legendary Bad Horse has retired, now you have to correctly answer the evil questions of Dr. Horrible, who has a PhD in horribleness (but not in Computer Science). You are given an array of N elements, which are initially all 0. After that you will be given C commands. They are -

* 0 p q v - you have to add v to all numbers in the range of p to q (inclusive), where p and q are two indexes of the array.

* 1 p q - output a line containing a single integer which is the sum of all the array elements between p and q (inclusive)

 

Input

In the first line you'll be given T, number of test cases.

Each test case will start with N (N <= 100 000) and C (C <= 100 000). After that you'll be given C commands in the format as mentioned above. 1 <= p, q <= N and 1 <= v <= 10^7.

Output

Print the answers of the queries.

Example

Input:
1
8 6
0 2 4 26
0 4 8 80
0 4 5 20
1 8 8
0 5 7 14
1 4 8

Output:
80
508

hide comments
javafreak: 2017-09-26 03:41:02

Very good problem for clearing basics of Segment Trees and Lazy Propagation, took my 4 hours, but totally worth it. Remember to take all long long values .

sarwar__05: 2017-09-25 23:24:46

My first Lazy. AC :D

Sigma Kappa: 2017-09-20 21:51:17

Yes, someone earlier mentioned that v must be long long, I agree -- turned my WA into AC.

hitman007: 2017-09-20 12:42:49

Moments of happiness when AC in one go after hours of implementation and testing !!

sagnik_66: 2017-09-06 17:25:18

Solved it first using Segment Trees. Then learnt BIT and solved it... Number of lines of code reduced to more then 2 times the original

jaykay12: 2017-09-03 12:15:29

Finally AC after 3 WA :) Nice Start for Segment Tree & Lazy Propagation.
Use long long int & clear the array after each testcase :)

sid_somani: 2017-08-28 19:09:58

Direct implementation of Seg trees+lazy!

glays: 2017-08-15 21:35:20

Encountering a WA? Change every single int to long long.
Trust me, I thought it was stupid too :D
Also oversize your arrays, as much as you can.

nikhil2504: 2017-08-06 18:21:34

Be careful with 1ll*(e-s+1)*tree[node]

mamun_cuet: 2017-07-28 20:01:09

yes,got AC


Added by:Iqram Mahmud
Date:2010-12-04
Time limit:2.329s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own. Thanks to Emir Habul.