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
sourabh: 2015-06-22 13:33:58

BIT it is :D

harkirat: 2015-05-28 18:41:38

Ac in first go!

Dhawal Harkawat: 2015-05-26 06:03:11

seems like v>10^7 ;(

appy: 2015-05-23 17:40:40

why v need to be long long ?? 1<=v<=1e7

Seshadri R: 2015-05-22 10:02:50

@ Rishab Banerjee: v is specified to be <= 10^7. During recursive calls, it remains an invariant and hence it cannot go beyond 10^7. This is well within an int limit (32-bits). So, may I know why long long int is required for v?

Abhilash: 2015-04-15 17:19:50

used BIT. think in terms of addition and multiplication for range updates in BIT

Anonymous: 2015-04-08 11:58:34

There is A bug within this judge i think i submitted like 50 times and every time was a WA on test 22 i hate this site

xxbloodysantaxx: 2015-04-02 09:13:12

BIT is so fast :) Lesser space... and everything ... Morover we can still use Segment tree without Lazy propagation just as in the case of BIT ... Lazy propagation is more useful in questions such as Flipping Coins

Malfple: 2015-03-31 13:51:48

Because of this problem, now i know how to update and query range using BIT :)

GAURAV CHANDEL: 2015-03-28 20:12:59

Using segment tree + lazy propagation AC
Having problem , visit http://se7so.blogspot.in/2012/12/segment-trees-and-lazy-propagation.html
very good tutorial


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.