1
#include<bits/stdc++.h>
2
#define ls p<<1ull
3
#define rs p<<1ull|1ull
4
namespace FastIO{
5
 char *p1,*p2,buf[1<<14];
6
 #define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,(1<<14),stdin),p1==p2)?EOF:*p1++)
7
 template <typename T>
8
 inline void read(T& x){
9
     x=0;
10
     register int t=1;
11
     register char ch=getchar();
12
     while(ch<'0'||ch>'9'){
13
         if(ch=='-')t=-1;
14
         ch=getchar();
15
     }
16
     while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
17
     x*=t;
18
 }
19
 template <typename T>
20
 void write(T x){
21
     if(x<0)putchar('-'),x=-x;
22
     if(x>9)write(x/10);
23
     putchar(x%10^48);
24
 }
25
 template <typename T>
26
 inline void writeln(T x,char sep='\n'){
27
  write(x);putchar(sep);
28
 }
29
}
30
using namespace FastIO;
31
using namespace std;
32
typedef long long ll;
33
const ll N=2e5+10;
34
ll n,q,W,s,i,p,l,r,k,mid,a[N];
35
struct info{ll s,id,tag;}tr[N<<2];
36
void Build(ll p,ll l,ll r){
37
    if(l==r)return tr[p].s=a[l],tr[p].id=l,void();
38
    ll mid=(l+r)>>1ull;
39
    Build(ls,l,mid);Build(rs,mid+1ull,r);
40
    tr[p].s=tr[ls].s+tr[rs].s;
41
}
42
void Pushdown(ll p,ll l,ll r){
43
    ll mid=(l+r)>>1ull;
44
    if(tr[p].tag)tr[ls].s+=tr[p].tag*(mid-l+1ull),tr[rs].s+=tr[p].tag*(r-mid),tr[ls].tag+=tr[p].tag,tr[rs].tag+=tr[p].tag,tr[p].tag=0;
45
}
46
void change(ll p,ll l,ll r,ll L,ll R,ll k){
47
    if(L<=l&&R>=r)return tr[p].tag+=k,tr[p].s+=(r-l+1ull)*k,void();
48
    Pushdown(p,l,r);
49
    ll mid=(l+r)>>1ull;
50
    if(L<=mid)change(ls,l,mid,L,R,k);
51
    if(R>mid)change(rs,mid+1ull,r,L,R,k);
52
    tr[p].s=tr[ls].s+tr[rs].s;
53
}
54
ll Query(ll p,ll l,ll r,ll k,ll now){
55
    if(tr[p].id) return tr[p].id;
56
    Pushdown(p,l,r);
57
    ll mid=(l+r)>>1ull;
58
    if(tr[ls].s*k>=now)return Query(ls,l,mid,k,now);
59
    return Query(rs,mid+1ull,r,k,now-tr[ls].s*k);
60
}
61
int main(){
62
    cin>>n>>q>>W;
63
    for(i=1ull;i<=n;i++)read(a[i]),s+=a[i];
64
    Build(1ull,1ull,n);
65
    while(q--){
66
        read(l);read(r);read(k);p=0;
67
        change(1ull,1ull,n,l,r,k);
68
        s+=(r-l+1ull)*k;
69
        l=1ull;r=log2(W/s);
70
        while(l<=r){
71
            mid=(l+r)>>1ull;
72
            if((((1ull<<mid+1ull)-1ull)*s)<=W)p=max(p,mid),l=mid+1ull;
73
            else r=mid-1ull;
74
        }
75
        if((((1ull<<p+1ull)-1ull)*s)==W)write(n*(p+1ull)-1ull),putchar('\n');
76
        else write(Query(1ull,1ull,n,(1ull<<p+1ull),W-(((1ull<<p+1ull)-1ull)*s))+n*(p+1ull)-1ull),putchar('\n');
77
    }
78
}