#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
struct SegTree {
	int size;
	LL *dat,*lazy;
	SegTree(int n) {
		size=1;
		while(size<n) size*=2;
		dat=(LL*)malloc(sizeof(LL)*(size*2-1));
		fill(dat,dat+(size*2-1),0);
		lazy=(LL*)malloc(sizeof(LL)*(size*2-1));
		fill(lazy,lazy+(size*2-1),0);
	}
	void eval(int k,int len) {
		dat[k]+=lazy[k]*len;
		if(k<size-1) lazy[k*2+1]+=lazy[k],lazy[k*2+2]+=lazy[k];
		lazy[k]=0;
	}
	void add(int a,int b,int  x,int k,int l,int r) {
		eval(k,r-l);
		if(r<=a||b<=l) return;
		if(a<=l&&r<=b) {
			lazy[k]+=x;
			eval(k,r-l);
		}else {
			add(a,b,x,k*2+1,l,(l+r)/2);
			add(a,b,x,k*2+2,(l+r)/2,r);
			dat[k]=dat[k*2+1]+dat[k*2+2];
		}
	}
	LL sum(int a,int b,int k,int l,int r) {
		eval(k,r-l);
		if(r<=a||b<=l) return 0;
		if(a<=l&&r<=b) return dat[k];
		return sum(a,b,k*2+1,l,(l+r)/2)+sum(a,b,k*2+2,(l+r)/2,r);
	}
};
int main() {
	int n,q;
	scanf("%d %d",&n,&q);
	SegTree S(n);
	for(int i=0;i<q;i++) {
		int type,s,t,x;
		scanf("%d",&type);
		if(type==0) {
			scanf("%d %d %d",&s,&t,&x);s--;
			S.add(s,t,x,0,0,S.size);
		}else {
			scanf("%d %d",&s,&t);s--;
			printf("%lld\n",S.sum(s,t,0,0,S.size));
		}
	}
}
### Prompt

Your task is to create a cpp solution to the following problem:

Write a program which manipulates a sequence A = {a1, a2, . . . , an} with the following operations:

* add(s, t, x): add x to as, as+1, ..., at.
* getSum(s, t): report the sum of as, as+1, ..., at.



Note that the initial values of ai (i = 1, 2, . . . , n) are 0.

Constraints

* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
* 1 ≤ s ≤ t ≤ n
* 0 ≤ x < 1000

Input


n q
query1
query2
:
queryq


In the first line, n (the number of elements in A) and q (the number of queries) are given. Then, ith query queryi is given in the following format:


0 s t x


or


1 s t


The first digit represents the type of the query. '0' denotes add(s, t, x) and '1' denotes getSum(s, t).

Output

For each getSum operation, print the sum;

Examples

Input

3 5
0 1 2 1
0 2 3 2
0 3 3 3
1 1 2
1 2 3


Output

4
8


Input

4 3
1 1 4
0 1 4 1
1 1 4


Output

0
4

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
struct SegTree {
	int size;
	LL *dat,*lazy;
	SegTree(int n) {
		size=1;
		while(size<n) size*=2;
		dat=(LL*)malloc(sizeof(LL)*(size*2-1));
		fill(dat,dat+(size*2-1),0);
		lazy=(LL*)malloc(sizeof(LL)*(size*2-1));
		fill(lazy,lazy+(size*2-1),0);
	}
	void eval(int k,int len) {
		dat[k]+=lazy[k]*len;
		if(k<size-1) lazy[k*2+1]+=lazy[k],lazy[k*2+2]+=lazy[k];
		lazy[k]=0;
	}
	void add(int a,int b,int  x,int k,int l,int r) {
		eval(k,r-l);
		if(r<=a||b<=l) return;
		if(a<=l&&r<=b) {
			lazy[k]+=x;
			eval(k,r-l);
		}else {
			add(a,b,x,k*2+1,l,(l+r)/2);
			add(a,b,x,k*2+2,(l+r)/2,r);
			dat[k]=dat[k*2+1]+dat[k*2+2];
		}
	}
	LL sum(int a,int b,int k,int l,int r) {
		eval(k,r-l);
		if(r<=a||b<=l) return 0;
		if(a<=l&&r<=b) return dat[k];
		return sum(a,b,k*2+1,l,(l+r)/2)+sum(a,b,k*2+2,(l+r)/2,r);
	}
};
int main() {
	int n,q;
	scanf("%d %d",&n,&q);
	SegTree S(n);
	for(int i=0;i<q;i++) {
		int type,s,t,x;
		scanf("%d",&type);
		if(type==0) {
			scanf("%d %d %d",&s,&t,&x);s--;
			S.add(s,t,x,0,0,S.size);
		}else {
			scanf("%d %d",&s,&t);s--;
			printf("%lld\n",S.sum(s,t,0,0,S.size));
		}
	}
}
```