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
ganeshjadhav: 2017-01-20 18:41:44

overflow caused two WA.

homiara_ruby: 2017-01-17 17:47:11

can be done using segment tree with lazy or using binary indexed tree.

esshuvo: 2017-01-11 16:26:20

This one is ACCEPTED code({spoiler})...Also this one is an ACCEPTED code({spoiler})..But,both of them output a different result for following dataset.I think first on is incorrect solution.Can anyone help me to find out which one is correct!
1
10000 10
0 2 1536 136
0 5236 53625 2362605
0 5236 53625 2362605
0 5236 53625 2362605
0 5236 53625 2362605
0 123 2561 1223656
0 123 2569 1223656
0 123 2565 1223656
0 123 2564 1223656
1 2 16320

edit(Francky)=>Please use forum for that. No code nor link in comment ; thanks.

Last edit: 2017-01-11 18:00:48
corphish: 2016-12-17 10:55:58

constantly getting runtime error !!! :( can somebody help...

hamzaziadeh: 2016-10-27 13:34:33

ac in 17 go ez with segment trees.

deepitauiu: 2016-10-23 17:39:52

why i get wrong answer all test case r correct

artemis1997: 2016-10-17 16:18:27

shubham, u did save my life

davidgalehouse: 2016-09-28 08:41:23

Segment tree is way easier to comprehend than BIT, especially because you can view it as a node-based tree, no need for array index tricks. Most of the pain comes late in the implementation w/ lazy propagation. For BIT (if you actually try to understand why it works), everything is painful. Especially for this problem, you have to go through 3 iterations, PURQ (what Fenwick did originally), then RUPQ (to help get a feel for what's next), and finally RURQ.

Last edit: 2016-09-28 08:44:59
shubham: 2016-09-14 16:10:27

this may save your life ((long long int)r - l + 1)*v

munjal: 2016-09-10 09:47:45

make sure that 1) use long in java.
2) while doing multiplication (end-start+1)*tree[node] , make it long. i.e. (long)((end-start+1)*tree[node]) .


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