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
devender issar:
20160725 11:53:21
I think input limits are wrong , looks like n can go beyond 100000 also.


liuxueyang:
20160724 14:50:24
@Dushyant Singh Thank you so much. :) 

akshayv3:
20160724 01:38:59
SQRT Decomposition+BIT (AC) 

Dushyant Singh:
20160722 15:31:23
@liuxueyang: v <= 10^7 and N<=10^5. That makes sum<=10^12 which will not fit in int. 

liuxueyang:
20160722 13:50:20
problem says: v <= 10^7, however, you must declare it long long.. don't know why... ;( 

Punit Bhatt:
20160710 15:42:07
Can anyone help me out? I have tried solving this problem using ST and Lazy Prop. but everytime I end up getting WA. Can someone please tell me what is wrong in this code? Thnx


faceless_man:
20160627 17:40:26
segment tree + lazy propagation .. solution given in hackerearth 

janvijay1997:
20160617 07:35:02
Used Dynamic Node Allocation + Lazy Propagation ! :) 

SANDEEP KUMAR:
20160125 13:41:11
Got AC(0.73 s), used cin and cout,no problemm.its all about your coding style..and yes remember to reset the arrays after each test cases...(which i realised after 4 WA's)


Deepak :
20160121 22:31:23
done with BIT..but still not confident with it 
Added by:  Iqram Mahmud 
Date:  20101204 
Time limit:  2.329s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Own. Thanks to Emir Habul. 