You have N integers, A₁, A₂, ... , A_N. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in a given interval.

The first line contains two numbers N and Q. 1 ≤ N,Q ≤ 100000. The second line contains N numbers, the initial values of A₁, A₂, ... , A_N. -1000000000 ≤ A_i ≤ 1000000000. Each of the next Q lines represents an operation. "C a b c" means adding c to each of A_a, A_a+1, ... , A_b. -10000 ≤ c ≤ 10000. "Q a b" means querying the sum of A_a, A_a+1, ... , A_b.

You need to answer all Q commands in order. One answer in a line.

#include<cstdio>

#include<cstring>

#include<cmath>

#include<iostream>

#include<algorithm>

using namespace std;

#define mem(x,y) memset(x,y,sizeof(x))

#define SI(x) scanf("%d",&x)

#define SL(x) scanf("%lld",&x)

#define PI(x) printf("%d",x)

#define P_ printf(" ")

#define PL(x) printf("%lld",x)

typedef long long LL;

const int INF=0x3f3f3f3f;

#define ll root<<1

#define rr root<<1|1

#define lson ll,l,mid

#define rson rr,mid+1,r

#define S(x) tree[x].sum

#define L(x) tree[x].lazy

const int MAXN=100010;

LL ans=0;

struct Node{

	LL lazy,sum;

};

Node tree[MAXN<<2];

void pushup(int root){

	S(root)=S(ll)+S(rr);

}

void pushdown(int root,int x){

	if(L(root)){

		L(ll)+=L(root);

		L(rr)+=L(root);

		S(ll)+=L(root)*(x-(x>>1));//注意

		S(rr)+=L(root)*(x>>1);

		L(root)=0;

	}

}

void build(int root,int l,int r){

	int mid=(l+r)>>1;

	L(root)=0;

	if(l==r){

		SL(S(root));

		//printf("%d %d %lld\n",l,r,S(root));

		return;

	}

	build(lson);

	build(rson);

	pushup(root);

}

void update(int root,int l,int r,int A,int B,int v){

		int mid=(l+r)>>1;

	if(l>=A&&r<=B){

		L(root)+=v;//注意是+=

		S(root)+=v*(r-l+1);

		return;

	}

	pushdown(root,r-l+1);

	if(mid>=A)update(lson,A,B,v);//注意

	if(mid<B)update(rson,A,B,v);//注意

	pushup(root);

}

void query(int root,int l,int r,int A,int B){

		int mid=(l+r)>>1;

		//printf("%d %d %lld\n",l,r,S(root));

	//	PI(A);P_;PI(B);

	if(l>=A&&r<=B){

		ans+=S(root);

		//printf("%d %d %lld\n",l,r,S(root));

		return;

	}

	pushdown(root,r-l+1);

	if(mid>=A)query(lson,A,B);//

	if(mid<B)query(rson,A,B);//

}

int main(){

	int N,Q;

	char s[2];

	int A,B,v;

	while(~scanf("%d%d",&N,&Q)){

		build(1,1,N);

		while(Q--){

			scanf("%s",s);

			if(s[0]=='Q'){

				scanf("%d%d",&A,&B);

				ans=0;

				query(1,1,N,A,B);

				printf("%lld\n",ans);

			}

			else{

				scanf("%d%d%d",&A,&B,&v);

				update(1,1,N,A,B,v);

			}

		}

	}

	return 0;

}

extern "C++"{

#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

using namespace  std;

typedef long long LL;

typedef unsigned u;

typedef unsigned long long ull;

#define mem(x,y) memset(x,y,sizeof(x))

void SI(double &x){scanf("%lf",&x);}

void SI(int &x){scanf("%d",&x);}

void SI(LL &x){scanf("%lld",&x);}

void SI(u &x){scanf("%u",&x);}

void SI(ull &x){scanf("%llu",&x);}

void SI(char *s){scanf("%s",s);}

void PI(int x){printf("%d",x);}

void PI(double x){printf("%lf",x);}

void PI(LL x){printf("%lld",x);}

void PI(u x){printf("%u",x);}

void PI(ull x){printf("%llu",x);}

void PI(char *s){printf("%s",s);}

#define NL puts("");

#define ll root<<1

#define rr root<<1|1

#define lson ll,l,mid

#define rson rr,mid+1,r

const int INF=0x3f3f3f3f;

const int MAXN=;

LL tree[MAXN << ];

LL lazy[MAXN << ];

}

void pushup(int root){

    tree[root] = tree[ll] + tree[rr];

}

void pushdown(int root,int x){

    if(lazy[root]){

        lazy[ll] += lazy[root];

        lazy[rr] += lazy[root];

    //    tree[ll]=lazy[root]*(mid-l+1);

    //    tree[rr]=lazy[root]*(r-mid);

        tree[ll] += lazy[root] * (x - (x >> ));

        tree[rr] += lazy[root] * (x >> );

        lazy[root] = ;

    }

}

void build(int root,int l,int r){

    int mid = (l + r) >> ;

    lazy[root] = ;

    if(l == r){

        SI(tree[root]);

        return ;

    }

    build(lson);

    build(rson);

    pushup(root);

}

void update(int root,int l,int r,int L,int R,int C){

    if(l >= L && r <= R){

        tree[root] += (r - l + ) * C;

        lazy[root] += C;

        return ;

    }

    int mid = (l + r) >> ;

    pushdown(root,r-l+);

    if(mid >= L)

        update(lson,L,R,C);

    if(mid < R)

        update(rson,L,R,C);

    pushup(root);

}

LL query(int root,int l,int r,int L,int R){

    int mid = (l + r) >> ;

    if(l >= L && r <= R){

        return tree[root];

    }

    pushdown(root,r-l+);

    LL ans = ;

    if(mid >= L)ans += query(lson,L,R);

    if(mid < R)ans += query(rson,L,R);

    return ans;

}

int main(){

    //assert(false);

    int N,M;

    while(~scanf("%d%d",&N,&M)){

        build(,,N);

        char s[];

        int l,r,c;

        while(M--){

            SI(s);

            SI(l);SI(r);

            if(s[]=='Q'){

                PI(query(,,N,l,r)),NL

            }

            else{

                SI(c);

                update(,,N,l,r,c);

            }

        }

    }

    return ;

}