1 #include <bits/stdc++.h>
2 using namespace std;
3 typedef long long ll;
4 const int maxn = 1e5+5;
5 ll a[maxn], add[maxn*4], sum[maxn*4];
6 ll n, m;
7 void pushup(int rt) {
8 sum[rt] = sum[rt*2]+sum[rt*2+1];
9 }
10 void pushdown(int rt, int l, int r) {
11 int mid = (l+r)/2;
12 sum[rt*2] = sum[rt*2]+add[rt]*(mid-l+1);
13 sum[rt*2+1] = sum[rt*2+1]+add[rt]*(r-mid);
14 add[rt*2] = add[rt*2]+add[rt];
15 add[rt*2+1] = add[rt*2+1]+add[rt];
16
17 add[rt] = 0;
18 }
19 void build(int l, int r, int rt) {
20 add[rt] = 0;
21 if (l == r) {
22 sum[rt] = a[l];
23 return;
24 }
25 int mid = (l+r)/2;
26 build(l,mid,rt*2);
27 build(mid+1,r,rt*2+1);
28 pushup(rt);
29 }
30 void update(int be, int ed, int val, int l, int r, int rt) {
31 if (be <= l && r <= ed) {
32 add[rt] = add[rt]+val;
33 sum[rt] = sum[rt]+val*(r-l+1);
34 return;
35 }
36 pushdown(rt,l,r);
37 int mid = (l+r)/2;
38 if (be <= mid) update(be,ed,val,l,mid,rt*2);
39 if (ed > mid) update(be,ed,val,mid+1,r,rt*2+1);
40 pushup(rt);
41 }
42 ll query(int be, int ed, int l, int r, int rt) {
43 if (be <= l && r <= ed) {
44 return sum[rt];
45 }
46 pushdown(rt,l,r);
47 ll res = 0; int mid = (l+r)/2;
48 if (be <= mid) res += query(be,ed,l,mid,rt*2);
49 if (ed > mid) res += query(be,ed,mid+1,r,rt*2+1);
50 return res;
51 }
52 int main() {
53 scanf("%d%d",&n,&m);
54 for (int i = 1; i <= n; i++) scanf("%lld",&a[i]);
55 build(1,n,1);
56 while (m--) {
57 int op, x, y; scanf("%d%d%d",&op,&x,&y);
58 if (op == 1) {
59 int k; scanf("%d",&k);
60 update(x,y,k,1,n,1);
61 }
62 else {
63 ll ans = query(x,y,1,n,1);
64 printf("%lld\n",ans);
65 }
66 }
67 return 0;
68 }
