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

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.

hide comments
2015-02-24 22:21:36 shanick
i have used segment tree+Lazy Propagation..I dont understand mistake in code...https://ideone.com/**********,,,,please have a look

(Francky) => Please read the notes, and use forum for any help.

Last edit: 2015-02-25 00:24:27
2015-02-20 08:29:30 Anne
too easy dude!
2015-01-24 11:46:18 Gaurav Bansal
i just used scanf and got ac in 0.34 sec using segtrees.can't understand why so many users are getting tle.
2015-01-17 11:39:25 Shubham Saini
Try solving it using both BIT and Segment Tree + Lazy Propagation. It will be worth the effort... :)
2015-01-06 19:43:47 Rishab Banerjee
anyone before solving read @nitish25 comments ie: take 'v' long long int
2014-12-25 09:50:11 Archit Jain
no need of BIT
2014-12-19 14:27:21 kelaseek
the indices are also long (or) long long int
2014-11-30 12:40:11 Wasim Thabraze
Try solving it using BIT. :)
2014-11-29 16:34:51 Siddharth Singh
I Used BIT But Still i am Getting Time Limit Exceeded :(
2014-11-26 02:12:18 Angel Gonzalez
My 75th, Segment Tree + Lazy Propagation = AC :) If you want a real challenge do it with BIT as well
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.