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
kartikay singh: 2015-10-24 18:33:57

Be-LAZY :P

topke: 2015-10-18 21:12:24

Dont use scanf of printf for that matter it gave me WA

rahul2907: 2015-10-02 12:01:15

segment tree + lazy propagation :) got AC :)

dev: 2015-09-20 16:58:37

be lazy ! small mistake caused me 5 hours for debugging...!

gandalf_: 2015-09-03 08:37:29

@Karan Tirthani, you can try it with Segment Tree + Lazy propagation
*********EDIT**********
IT SHALL NOT PASS
EDIT: WITH BIT

Last edit: 2015-09-03 08:38:22
Karan Tirthani: 2015-07-26 23:02:22

BIT is giving TLE.
I am using long long int as well.
Can anyone suggest any way to optimize it?

Avinash Kumar: 2015-07-23 14:48:53

Take value in long long got 3 WA due to that

aman mahansaria: 2015-07-20 08:53:26

changed int to long long and got AC:)

shravinson: 2015-07-18 15:35:15

stupid mistakes cause some WA
finally got AC

Last edit: 2015-07-19 19:12:35
John: 2015-07-14 08:29:42

its not just another BIT problem .. new things to learn here :)


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