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
Bumbler: 2014-06-06 12:27:15

It feels good after solving this one using segment trees !

GURVINDER SINGH: 2014-05-16 01:05:13

AC be careful with the use of long long int :)

LOST: 2014-04-04 19:38:05

Aced..phewwww..:)

zicowa: 2014-03-23 12:38:41

solved by both bit and segment tree

zicowa: 2014-03-23 12:38:14

thanx nitish25 it also costed me two WAs

(Tjandra Satria Gunawan)(曾毅昆): 2014-02-28 18:49:44

My First BIT problem :)
Still couldn't optimize my BIT code optimally..

terserah: 2014-02-08 10:36:52

how to do range update using BIT?

Abhishek Gupta: 2014-01-15 16:28:14

i did it with both BIT & segment tree...BIT was much fast!!!
very nice problem though...

Last edit: 2014-01-17 08:23:34
ankit kumar sinha: 2013-12-11 20:09:23

My segment tree getting TLE :-(. any advise?

vb: 2013-12-01 19:02:55

some edge cases please


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.