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
kkislay20:
20180419 16:21:55
Can somebody please help me where my code is wrong. It somehow isn't working for big numbers. 

dipankar12:
20180401 14:17:50
v is long and not int for JAVA users. Cost me 10 WAs. 

shahianshu:
20180308 12:21:51
use long long int , take care of the size and clear the array after every test case and you will get ac by using segment tree with lazy propagation. 

kkrishnaai:
20180208 19:09:01
For those who are wondering about the array size, 4*n + 1 is sufficient coz 4*n are the maximum number of vertices in the tree for any n in a complete binary tree (plus 1 is required if u're starting with index 1). 

amitboss:
20180129 16:43:38
use long long instead of int , caused me 1 wa 

ramini1996:
20180128 17:28:44
My first in Lazy !!! 

pant0000:
20180103 12:42:11
Last edit: 20180103 12:59:33 

madhur4127:
20171226 13:57:38
Last edit: 20171226 16:13:53 

manishkc:
20171221 20:50:40
binary index tree AC :) 

chachaji_harsh:
20171209 14:37:07
Last edit: 20171209 14:37:28 
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. 