#include<bits/stdc++.h>
#define IL inline
#define reg register
#define N 200200
#define M 80008000
IL int read()
{
    reg int x=0; reg char ch=getchar();
    while(ch<'0'||ch>'9')ch=getchar();
    while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
    return x;
}

int n,k,E,p[N];
int a[N],b[N],w[N];

IL void cmax(reg int &x,reg int y){x<y?x=y:0;}
IL int max(reg int x,reg int y){return x>y?x:y;}
IL int min(reg int x,reg int y){return x<y?x:y;}

int buf[M],*dp,*now=buf;

IL void copy(reg int *f,reg int *g){for(reg int i=0;i<=k;++i)f[i]=g[i];}

IL void add(reg int *f,reg int x,reg int w)
{
    for(reg int i=k;i>=x;--i)
        cmax(f[i],f[i-x]+w);
}

IL bool check(reg int *f)
{
    long long sum=0;
    for(reg int i=1;i<=k;++i)sum+=E-f[i];
    return sum>=0;
}

void dc(reg int l,reg int r,reg int ql,reg int qr)
{
    if(ql>qr)return;
    if(l==r)
    {
        for(reg int i=ql;i<=qr;++i)p[i]=l;
        return;
    }
    int *odp=now;
    now+=k+1;
    int *tmp=now;
    now+=k+1,copy(odp,dp);
    reg int mid=l+r+1>>1,L=max(ql,mid),R=qr,Mid,pos;
    for(reg int i=l;i<mid;++i)add(dp,a[i],w[i]);
    for(reg int i=mid;i<=min(r,ql-1);++i)add(dp,b[i],w[i]);
    while(L<=R)
    {
        Mid=L+R>>1,copy(tmp,dp);
        for(reg int i=L;i<=Mid;++i)add(dp,b[i],w[i]);
        for(reg int i=R;i>Mid;--i)add(dp,a[i],w[i]);
        if(!check(dp))
        {
            copy(dp,tmp);
            for(reg int i=L;i<=Mid;++i)add(dp,b[i],w[i]);
            L=Mid+1;
        }else
        {
            copy(dp,tmp);
            for(reg int i=R;i>=Mid;--i)add(dp,a[i],w[i]);
            R=Mid-1;
        }
    }
    pos=R,copy(dp,odp);
    for(reg int i=qr;i>pos;--i)add(dp,a[i],w[i]);
    for(reg int i=mid;i<=r&&i<ql;++i)add(dp,b[i],w[i]);
    dc(l,mid-1,ql,pos);
    copy(dp,odp);
    for(reg int i=l;i<mid;++i)add(dp,a[i],w[i]);
    for(reg int i=pos;i>=l&&i>r;--i)add(dp,b[i],w[i]);
    dc(mid,r,pos+1,qr);
    copy(dp,odp),now-=k+1<<1;
}

main()
{
    n=read(),k=read(),E=read();
    for(reg int i=1;i<=n;++i)
        w[i]=read(),a[i]=read(),b[i]=read();
    dp=now,now+=k+1;
    int *tmp; tmp=now,now+=k+1;
    reg int l=1,r=n,mid;
    while(l<=r)
    {
        mid=l+r>>1,copy(tmp,dp);
        for(reg int i=l;i<=mid;++i)add(dp,b[i],w[i]);
        for(reg int i=r;i>mid;--i)add(dp,a[i],w[i]);
        if(!check(dp))
        {
            copy(dp,tmp);
            for(reg int i=l;i<=mid;++i)add(dp,b[i],w[i]);
            l=mid+1;
        }else
        {
            copy(dp,tmp);
            for(reg int i=r;i>=mid;--i)add(dp,a[i],w[i]);
            r=mid-1;
        }
    }
    now-=k+1;
    for(reg int i=0;i<=k;++i)dp[i]=0;
    dc(1,n,l,n);
    long long ans=0;
    for(reg int i=1;i<=n;++i)ans+=p[i];
    printf("%lld\n",ans);
}