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
freakash:
20181009 08:46:22
Nice Question (solved using ST+lazy prop)


harry_shit:
20180927 15:20:11
ac in 100000000th time 

sahilsinghss:
20180912 20:09:30
Try using segment trees! 

tanardi gunawan:
20180904 08:40:47
Jasjus got AC in 1 go.


lelouch_vi:
20180725 15:57:51
use only long long int


codechat:
20180629 07:48:37
Very helpful problem for lazy propogation


jmr99:
20180619 11:55:45
for b index tree refer this


jmr99:
20180618 17:40:47
AC in one go !! simple lazy


imrekcah:
20180608 20:57:37
anybody tried using Range update range query fenwick tree/Binary indexed tree giving me a WA


xtmosphere:
20180602 06:30:17
for(ll i=p;i<=q;i++)

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. 