#include <iostream>
#include <vector>
#include<algorithm>
#include<iomanip>
#include<queue>
#include<map>
#include<bitset>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
typedef pair<int,int> pint;
typedef long long ll;
const int inf   = 1e9+7;
const ll  longinf = 1LL<<60;
const int mod=1e9+7;
int dx[4]={1,0,-1,0}, dy[4]={0,1,0,-1};

struct LazySegmentTree{
  int sz=1;
  vector<ll> node,lazy;
  LazySegmentTree(int n){
    while(sz<n)sz*=2;
    node.resize(2*sz-1,0);
    lazy.resize(2*sz-1,0);
    }
  
  void eval(int k,int l,int r){
    if(lazy[k]){
      node[k]+=lazy[k];
      if(r-l>1){
        lazy[2*k+1]+=lazy[k]/2;
        lazy[2*k+2]+=lazy[k]/2;
        }
      lazy[k]=0;
      }
    }
  
  void add(ll x,int a,int b,int k,int l,int r){
    eval(k,l,r);
    if(b<=l||r<=a)return;
    if(a<=l&&r<=b){
      lazy[k]+=x*(r-l);
      eval(k,l,r);
      return;
      }
    add(x,a,b,2*k+1,l,(l+r)/2);
    add(x,a,b,2*k+2,(l+r)/2,r);
    node[k]=node[2*k+1]+node[2*k+2];
    }
  
  ll get(int a,int b,int k,int l,int r){
    eval(k,l,r);
    if(b<=l||r<=a)return 0;
    if(a<=l&&r<=b)return node[k];
    ll vl=get(a,b,2*k+1,l,(l+r)/2);
    ll vr=get(a,b,2*k+2,(l+r)/2,r);
    return vl+vr;
    }
  
  void add(ll x,int a,int b){
    add(x,a,b,0,0,sz);
    }
  ll get(int a,int b){
    return get(a,b,0,0,sz);
    }  
  
  };

int main(){
  int n;cin>>n;
  LazySegmentTree lst(n);
  int q;cin>>q;
  rep(i,q){
    int t;cin>>t;
    if(!t){
      int a,b,x;
      cin>>a>>b>>x;
      lst.add(x,a-1,b);
      }
    else{
      int a,b;
      cin>>a>>b;
      cout<<lst.get(a-1,b)<<endl;
      }
    }
  return 0;
  }

### Prompt

Construct a CPP code solution to the problem outlined:

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 <vector>
#include<algorithm>
#include<iomanip>
#include<queue>
#include<map>
#include<bitset>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
typedef pair<int,int> pint;
typedef long long ll;
const int inf   = 1e9+7;
const ll  longinf = 1LL<<60;
const int mod=1e9+7;
int dx[4]={1,0,-1,0}, dy[4]={0,1,0,-1};

struct LazySegmentTree{
  int sz=1;
  vector<ll> node,lazy;
  LazySegmentTree(int n){
    while(sz<n)sz*=2;
    node.resize(2*sz-1,0);
    lazy.resize(2*sz-1,0);
    }
  
  void eval(int k,int l,int r){
    if(lazy[k]){
      node[k]+=lazy[k];
      if(r-l>1){
        lazy[2*k+1]+=lazy[k]/2;
        lazy[2*k+2]+=lazy[k]/2;
        }
      lazy[k]=0;
      }
    }
  
  void add(ll x,int a,int b,int k,int l,int r){
    eval(k,l,r);
    if(b<=l||r<=a)return;
    if(a<=l&&r<=b){
      lazy[k]+=x*(r-l);
      eval(k,l,r);
      return;
      }
    add(x,a,b,2*k+1,l,(l+r)/2);
    add(x,a,b,2*k+2,(l+r)/2,r);
    node[k]=node[2*k+1]+node[2*k+2];
    }
  
  ll get(int a,int b,int k,int l,int r){
    eval(k,l,r);
    if(b<=l||r<=a)return 0;
    if(a<=l&&r<=b)return node[k];
    ll vl=get(a,b,2*k+1,l,(l+r)/2);
    ll vr=get(a,b,2*k+2,(l+r)/2,r);
    return vl+vr;
    }
  
  void add(ll x,int a,int b){
    add(x,a,b,0,0,sz);
    }
  ll get(int a,int b){
    return get(a,b,0,0,sz);
    }  
  
  };

int main(){
  int n;cin>>n;
  LazySegmentTree lst(n);
  int q;cin>>q;
  rep(i,q){
    int t;cin>>t;
    if(!t){
      int a,b,x;
      cin>>a>>b>>x;
      lst.add(x,a-1,b);
      }
    else{
      int a,b;
      cin>>a>>b;
      cout<<lst.get(a-1,b)<<endl;
      }
    }
  return 0;
  }

```