1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int a[100005];
 4 int sumv[400005];
 5 int addv[400005];
 6 int ans=0,K;
 7 struct SegTree
 8 {
 9 #define lson (o<<1)
10 #define rson (o<<1|1)
11 inline void pushup(int o)
12 {
13     int tmp=sumv[lson]+sumv[rson];
14     if(sumv[o]<=K&&tmp>K) ans++;
15     if(sumv[o]>K&&tmp<=K) ans--;
16     sumv[o]=tmp;
17 }
18 inline void pushdown(int o,int l,int r){
19      if(!addv[o]) {return;}
20      int mid=(l+r)>>1,tag=addv[o];
21      addv[lson]+=tag;addv[rson]+=tag;
22      int tmp1=sumv[lson]+tag*(mid-l+1);
23      int tmp2=sumv[rson]+tag*(r-mid);
24      if(sumv[lson]<=K&&tmp1>K) ans++;
25      if(sumv[lson]>K&&tmp1<=K) ans--;
26      if(sumv[rson]<=K&&tmp2>K) ans++;
27      if(sumv[rson]>K&&tmp2<=K) ans--;
28      sumv[lson]=tmp1;
29      sumv[rson]=tmp2;
30      addv[o]=0;
31 }
32 inline void build(int o,int l,int r){
33      if(l==r){sumv[o]=a[l];if(sumv[o]>K)ans++;return;}
34      int mid=(l+r)>>1;
35      build(lson,l,mid);
36      build(rson,mid+1,r);
37      pushup(o);
38 }
39 inline void optadd(int o,int l,int r,int ql,int qr,int v){
40      if(ql<=l&&r<=qr){int tmp=v*(r-l+1);
41      if(sumv[o]<=K&&sumv[o]+tmp>K) ans++;
42      if(sumv[o]>K&&sumv[o]+tmp<=K) ans--;
43      sumv[o]+=tmp;
44      addv[o]+=v;
45      return;
46    }
47      int mid=(l+r)>>1;
48      pushdown(o,l,r);
49      if(ql<=mid)optadd(lson,l,mid,ql,qr,v);
50      if(qr>mid)optadd(rson,mid+1,r,ql,qr,v);
51      pushup(o);
52 }
53 }seg;
54 int main()
55 {
56     int N,M;
57     while(scanf("%d%d%d",&N,&M,&K)!=EOF){ans=0;
58         for(int i=1;i<=N;++i) scanf("%d",a+i);
59         memset(addv,0,sizeof(addv));
60         seg.build(1,1,N);//cout<<ans<<endl;
61         int opt,l,r,x;
62         while(M--){
63             scanf("%d%d%d%d",&opt,&l,&r,&x);
64             if(opt==2) x=-x;
65             seg.optadd(1,1,N,l,r,x);
66             printf("%d\n",ans);
67         }
68     }
69     return 0;
70 }