1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<cmath>
 5 using namespace std;
 6 long long tree[300001],lazy[300001];
 7 long long sum,a[300001],n,m;
 8 int build(int i,int left,int right){
 9     if(left==right){
10         tree[i]=a[left];
11         return
 
 0;
12     }
13     int mid=(left+right)/2;
14     build(i*2,left,mid);
15     build(i*2+1,mid+1,right);
16     tree[i]=tree[i*2]+tree[i*2+1];
17 }
18 int f(int p,int l,int r,int val){
19     lazy[p]+=val;
20     tree[p]+=val*(r-l+1);
21 }
22 int push_down(int p,int l,int r){
23     int mid=(l+r)/2;
24     f(p*2
 
,l,mid,lazy[p]);
25     f(p*2+1,mid+1,r,lazy[p]);
26     lazy[p]=0;
27 }
28 int turn(int i,int left,int right,int b_l,int b_r,long long val){
29     if(b_l<=left&&right<=b_r){
30         tree[i]+=(right-left+1)*val;
31         lazy[i]+=val;
32         return 0;
33     }
34     push_down(i,left,right);
 
35     int mid=(left+right)/2;
36     if(b_l<=mid) turn(i*2,left,mid,b_l,b_r,val);
37     if(mid+1<=b_r) turn(i*2+1,mid+1,right,b_l,b_r,val);
38     tree[i]=tree[i*2]+tree[i*2+1];
39 }
40 int search(int i,int left,int right,int b_l,int b_r){
41     if(right<b_l||b_r<left) return 0;
42     if(b_l<=left&&right<=b_r){
43         sum+=tree[i];
44         return 0;
45     }
46     push_down(i,left,right);
47     int mid=(left+right)/2;
48     if(b_l<=mid) search(i*2,left,mid,b_l,b_r);
49     if(mid+1<=b_r) search(i*2+1,mid+1,right,b_l,b_r);
50 }
51 int main(){
52     //freopen("P3372_8.in","r",stdin);
53     scanf("%lld%lld",&n,&m);
54     for(register int i=1;i<=n;i++) scanf("%lld",&a[i]);
55     build(1,1,n);
56     while(m--){
57         int ooo;
58         scanf("%d",&ooo);
59         if(ooo==1){
60             int L,R;
61             long long K;
62             scanf("%d%d%lld",&L,&R,&K);
63             turn(1,1,n,L,R,K);
64             continue;
65         }
66         int L,R;
67         scanf("%d%d",&L,&R);
68         sum=0;
69         search(1,1,n,L,R);
70         printf("%lld\n",sum);
71     }
72 }