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
sumit agarwal: 2013-06-20 19:55:38

used fenwick tree....but got TLE :(

elvis rusnel capia quispe: 2013-05-28 20:17:19

YOU CAN USE FENWICK TREE

NIKA: 2013-02-12 18:43:58

my segment tree gets WA after running for 6 secs :\ is there any tricky test case?

strings: 2013-02-04 17:38:29

Yay!! my 1st Segment tree !!

Satinjal Yadav: 2013-01-31 09:05:01

why time limit exceeded ?
even time limit is 15s. anyone has any clue please help!

uberness132: 2012-03-20 03:42:03

use a 64bit integer

darryl: 2012-12-29 19:17:51

watch out for overflows :)


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.