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
sahilsinghss: 2018-09-12 20:09:30

Try using segment trees!

tanardi gunawan: 2018-09-04 08:40:47

Jasjus got AC in 1 go.
Jasjus didn't write " AC in 1 go" in comment section.
He know it was an easy question and there is no meaning to show of.
Jasjus is smart.
Be like Jasjus

lelouch_vi: 2018-07-25 15:57:51

use only long long int

codechat: 2018-06-29 07:48:37

Very helpful problem for lazy propogation

jmr99: 2018-06-19 11:55:45

for b index tree refer this
https://apps.topcoder.com/forums/?module=Thread&threadID=715842&start=0&mc=8
in the comment section there is idea about it.

jmr99: 2018-06-18 17:40:47

AC in one go !! simple lazy
for those who don't know lazy prop..
refer this to learn
https://www.hackerearth.com/practice/notes/segment-tree-and-lazy-propagation/

Last edit: 2018-06-18 17:41:02
imrekcah: 2018-06-08 20:57:37

anybody tried using Range update range query fenwick tree/Binary indexed tree giving me a WA

xtmosphere: 2018-06-02 06:30:17

for(ll i=p;i<=q;i++)
updateBIT(BITree,N,i,v);
I am using BIT and i think this loop is increasing my complexity , please tell me solution to this .....

Last edit: 2018-06-02 06:30:53
lamia2658: 2018-05-22 20:57:38

not clearing trees array, lazy and and given array cost me 5 WAs.. :')

learnerinblack: 2018-05-21 15:09:36

Hey, when I keep size of my segment tree to be 200010(2*1e5+1) it gives run time error(SEGMENTATION FAULT) but when I increase it to 1e6 it passes the tests. With n <= 1e5 I think 2*1e5+1 was enough. Any Ideas?


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.