#include <iostream>
#include <climits>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;

void lazy_query(ll k,ll l,ll r, vector<ll>& node, vector<ll>& lazy, ll n) {
	node[k] += lazy[k] * (r - l);
	if (k < n - 1) {
		lazy[2 * k + 1] += lazy[k];
		lazy[2 * k + 2] += lazy[k];
	}
	lazy[k] = 0;
}

void add(ll a, ll b, ll x, ll k, ll l, ll r, vector<ll>&node, vector<ll>& lazy, ll n) {
	lazy_query(k, l, r, node, lazy, n);
	if (r <= a || b <= l)return;
	if (a <= l && r <= b) {
		lazy[k] += x;
		lazy_query(k, l, r, node, lazy, n);
		return;
	}
	else {
		add(a, b, x, 2 * k + 1, l, (l + r) / 2, node, lazy, n);
		add(a, b, x, 2 * k + 2, (l + r) / 2, r, node, lazy, n);
		node[k] = node[2 * k + 1] + node[2 * k + 2];
		return;
	}
}

ll getSum(ll a, ll b, ll k, ll l, ll r, vector<ll>&node, vector<ll>& lazy, ll n) {
	lazy_query(k, l, r, node, lazy, n);
	if (r <= a || b <= l)return 0;
	if (a <= l && r <= b) {
		return node[k];
	}
	else {
		ll vl = getSum(a, b, 2 * k + 1, l, (l + r) / 2, node, lazy, n);
		ll vr = getSum(a, b, 2 * k + 2, (l + r) / 2, r, node, lazy, n);
		node[k] = node[2 * k + 1] + node[2 * k + 2];
		return vr + vl;
	}
}

int main() {
	cin.tie(0); ios::sync_with_stdio(false);
	int n_, q;  cin >> n_ >> q;
	int n = 1;
	while (n < n_) n *= 2;
	vector<ll> node(2 * n - 1, 0);
	vector<ll> lazy(2 * n - 1, 0);

	for (int i = 0; i < q; i++) {
		int com; cin >> com;
		if (com == 0) {
			ll s, t, x; cin >> s >> t >> x;
			add(s - 1, t, x, 0, 0, n, node, lazy, n);
		}
		else {
			ll s, t; cin >> s >> t;
			cout << getSum(s - 1, t, 0, 0, n, node, lazy, n) << endl;
		}
	}
}
### Prompt

Develop a solution in Cpp to the problem described below:

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 <iostream>
#include <climits>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;

void lazy_query(ll k,ll l,ll r, vector<ll>& node, vector<ll>& lazy, ll n) {
	node[k] += lazy[k] * (r - l);
	if (k < n - 1) {
		lazy[2 * k + 1] += lazy[k];
		lazy[2 * k + 2] += lazy[k];
	}
	lazy[k] = 0;
}

void add(ll a, ll b, ll x, ll k, ll l, ll r, vector<ll>&node, vector<ll>& lazy, ll n) {
	lazy_query(k, l, r, node, lazy, n);
	if (r <= a || b <= l)return;
	if (a <= l && r <= b) {
		lazy[k] += x;
		lazy_query(k, l, r, node, lazy, n);
		return;
	}
	else {
		add(a, b, x, 2 * k + 1, l, (l + r) / 2, node, lazy, n);
		add(a, b, x, 2 * k + 2, (l + r) / 2, r, node, lazy, n);
		node[k] = node[2 * k + 1] + node[2 * k + 2];
		return;
	}
}

ll getSum(ll a, ll b, ll k, ll l, ll r, vector<ll>&node, vector<ll>& lazy, ll n) {
	lazy_query(k, l, r, node, lazy, n);
	if (r <= a || b <= l)return 0;
	if (a <= l && r <= b) {
		return node[k];
	}
	else {
		ll vl = getSum(a, b, 2 * k + 1, l, (l + r) / 2, node, lazy, n);
		ll vr = getSum(a, b, 2 * k + 2, (l + r) / 2, r, node, lazy, n);
		node[k] = node[2 * k + 1] + node[2 * k + 2];
		return vr + vl;
	}
}

int main() {
	cin.tie(0); ios::sync_with_stdio(false);
	int n_, q;  cin >> n_ >> q;
	int n = 1;
	while (n < n_) n *= 2;
	vector<ll> node(2 * n - 1, 0);
	vector<ll> lazy(2 * n - 1, 0);

	for (int i = 0; i < q; i++) {
		int com; cin >> com;
		if (com == 0) {
			ll s, t, x; cin >> s >> t >> x;
			add(s - 1, t, x, 0, 0, n, node, lazy, n);
		}
		else {
			ll s, t; cin >> s >> t;
			cout << getSum(s - 1, t, 0, 0, n, node, lazy, n) << endl;
		}
	}
}
```