#include<bits/stdc++.h>
#define int long long
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

class LazySegmentTree
{
 private:
    int n;
    vector<int> node,lazy;
 public:
    LazySegmentTree(int sz){
        n=1;
        while(n<sz) n*=2;
        node.assign(2*n-1,0LL);
        lazy.assign(2*n-1,0LL);
    }
    void update(int a,int b,int x,int k,int l,int r){
        if(a<=l and r<=b){
            node[k]+=x*(r-l);
            lazy[k]+=x;
        }else{
            if(lazy[k]!=0) push(k,l,r),lazy[k]=0;
            if(check(a,b,l,(l+r)/2)) update(a,b,x,2*k+1,l,(l+r)/2);
            if(check(a,b,(l+r)/2,r)) update(a,b,x,2*k+2,(l+r)/2,r);
            node[k]=node[2*k+1]+node[2*k+2];
        }
    }
    int get(int a,int b,int k,int l,int r){
        if(a<=l and r<=b){
            return node[k];
        }else{
            if(lazy[k]!=0) push(k,l,r),lazy[k]=0;
            int res=0;
            if(check(a,b,l,(l+r)/2)) res+=get(a,b,2*k+1,l,(l+r)/2);
            if(check(a,b,(l+r)/2,r)) res+=get(a,b,2*k+2,(l+r)/2,r);
            return res;
        }
    }
    void push(int k,int l,int r){
        node[2*k+1]+=lazy[k]*(r-l)/2; lazy[2*k+1]+=lazy[k];
        node[2*k+2]+=lazy[k]*(r-l)/2; lazy[2*k+2]+=lazy[k];
    }
    bool check(int a,int b,int l,int r){
        return max(a,l)<min(b,r);
    }
    void update(int a,int b,int x){ update(a,b,x,0,0,n); }
    int get(int a,int b){ return get(a,b,0,0,n); }
};

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N,Q; cin>>N>>Q;
    LazySegmentTree seg(N);
    while(Q--){
        int q; cin>>q;
        if(q==0){
            int s,t,x; cin>>s>>t>>x;
            s--;
            seg.update(s,t,x);
        }else{
            int s,t; cin>>s>>t;
            s--;
            cout<<seg.get(s,t)<<endl;
        }
        // for(int i=0;i<4;i++) cout<<seg.get(i,i+1)<<' '; cout<<endl;
    }
    return 0;
}

### 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>
#define int long long
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

class LazySegmentTree
{
 private:
    int n;
    vector<int> node,lazy;
 public:
    LazySegmentTree(int sz){
        n=1;
        while(n<sz) n*=2;
        node.assign(2*n-1,0LL);
        lazy.assign(2*n-1,0LL);
    }
    void update(int a,int b,int x,int k,int l,int r){
        if(a<=l and r<=b){
            node[k]+=x*(r-l);
            lazy[k]+=x;
        }else{
            if(lazy[k]!=0) push(k,l,r),lazy[k]=0;
            if(check(a,b,l,(l+r)/2)) update(a,b,x,2*k+1,l,(l+r)/2);
            if(check(a,b,(l+r)/2,r)) update(a,b,x,2*k+2,(l+r)/2,r);
            node[k]=node[2*k+1]+node[2*k+2];
        }
    }
    int get(int a,int b,int k,int l,int r){
        if(a<=l and r<=b){
            return node[k];
        }else{
            if(lazy[k]!=0) push(k,l,r),lazy[k]=0;
            int res=0;
            if(check(a,b,l,(l+r)/2)) res+=get(a,b,2*k+1,l,(l+r)/2);
            if(check(a,b,(l+r)/2,r)) res+=get(a,b,2*k+2,(l+r)/2,r);
            return res;
        }
    }
    void push(int k,int l,int r){
        node[2*k+1]+=lazy[k]*(r-l)/2; lazy[2*k+1]+=lazy[k];
        node[2*k+2]+=lazy[k]*(r-l)/2; lazy[2*k+2]+=lazy[k];
    }
    bool check(int a,int b,int l,int r){
        return max(a,l)<min(b,r);
    }
    void update(int a,int b,int x){ update(a,b,x,0,0,n); }
    int get(int a,int b){ return get(a,b,0,0,n); }
};

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N,Q; cin>>N>>Q;
    LazySegmentTree seg(N);
    while(Q--){
        int q; cin>>q;
        if(q==0){
            int s,t,x; cin>>s>>t>>x;
            s--;
            seg.update(s,t,x);
        }else{
            int s,t; cin>>s>>t;
            s--;
            cout<<seg.get(s,t)<<endl;
        }
        // for(int i=0;i<4;i++) cout<<seg.get(i,i+1)<<' '; cout<<endl;
    }
    return 0;
}

```