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
mamun_cuet:
20170728 16:52:32
used long long int, ar size 1e6 but Getting WA, need some test cases 

soham_12345:
20170721 22:36:06
remember to clear arrays after each testcase.costed me 3 WAs 

namitp:
20170718 11:06:22
int costed me 1 WA }("_"){


vinhvo:
20170624 23:18:00
Using v as Integer won't work in Java, somehow it needs to be long as well. Even though, the question clearly stated 1 <= v <= 10^7 

anshulwarade:
20170624 12:43:07
IMPORTANT: use everything in long long, take size 4*(1e6+1) 

deepak1228:
20170621 00:18:01
tushar lazy propagation helped alot!!! 

starbot:
20170609 21:03:13
take everything in long long and also take arr size 1e6.... 

sharif ullah:
20170602 20:30:18
Wrong answer???? it is nothing but overflow!!!!!!!!!!!! check 

syamphanindra:
20170531 14:41:28
Ohh no! many days it take to understand and apply ...best tutorial for segment trees is found in hackerearth use it for beginners of segment tress like me:) 

prabodh prakash:
20170514 07:35:21
Super recommended to learn segment tree. I would urge problem solvers to also solve this question for maximum over a range. The whole concept of segment tree and lazy propagation will become clear. 
Added by:  Iqram Mahmud 
Date:  20101204 
Time limit:  2.329s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own. Thanks to Emir Habul. 