#include<bits/stdc++.h>

#define ll long long
#define int long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

void cmax(ll &x,ll v){x=max(x,v);}

const int N=2e5+5;
const ll INF=1e11;
int n,k,a[N],b[N],c[N],E;
struct Knap{
	vector<ll>f;
	void init(){f.clear(),f.resize(k+1,0);}
	void ins(int x,int v){for(int i=k;i>=x;i--)cmax(f[i],f[i-x]+v);}
	bool valid(){
		// cout<<"check_valid f = ";for(int i=1;i<=k;i++)cout<<f[i]<<" ";puts("");
		ll res=0;for(int i=0;i<=k;i++)res+=f[i];return res<=1ll*k*E;
	}
};

int res[N];
Knap A;
void solve(int l,int r,int s,int t){
	// cout<<"solve "<<l<<" "<<r<<" "<<s<<" "<<t<<endl;
	if(l>r)return ;
	if(s==t){for(int i=l;i<=r;i++)res[i]=s;return ;}
	Knap B=A;
	int p=(l+r)>>1,L=max(s,p),R=t,ans=t+1;
	// cout<<"p = "<<p<<endl;
	for(int i=l;i<p;i++)B.ins(a[i],c[i]);
	for(int i=p;i<=min(r,s-1);i++)B.ins(b[i],c[i]);
	// for(int i=l;i<p;i++)cout<<"ins1 "<<i<<endl;
	// for(int i=p;i<=min(r,s-1);i++)cout<<"ins2 "<<i<<endl;
	while(L<=R){
		int mid=(L+R)>>1;
		// cout<<"check mid = "<<mid<<endl;
		auto C=B;
		// for(int i=mid+1;i<=R;i++)cout<<"try ins1 "<<i<<endl;
		// for(int i=max(L,p);i<=mid;i++)cout<<"try ins2 "<<i<<endl;
		for(int i=mid+1;i<=R;i++)C.ins(a[i],c[i]);
		for(int i=max(L,p);i<=mid;i++)C.ins(b[i],c[i]);
		if(C.valid()){
			// puts("valid");
			// for(int i=mid;i<=R;i++)cout<<"ins1 "<<i<<endl;
			for(int i=mid;i<=R;i++)B.ins(a[i],c[i]);
			ans=mid,R=mid-1;
		}
		else{
			// puts("invalid");
			// for(int i=max(L,p);i<=mid;i++)cout<<"ins2 "<<i<<endl;
			for(int i=max(L,p);i<=mid;i++)B.ins(b[i],c[i]);
			L=mid+1;
		}
	}
	res[p]=ans;
	// cout<<"res "<<p<<" = "<<ans<<endl;
	
	B=A;
	// for(int i=ans+1;i<=t;i++)cout<<"all -> ins1 "<<i<<endl;
	// for(int i=p;i<=min(r,s-1);i++)cout<<"all -> ins2 "<<i<<endl;
	for(int i=min(ans,t)+1;i<=t;i++)A.ins(a[i],c[i]);
	for(int i=p;i<=min(r,s-1);i++)A.ins(b[i],c[i]);
	solve(l,p-1,s,min(ans,t));
	
	// A=B;for(int i=l;i<=p;i++)cout<<"all -> ins1 "<<i<<endl;
	// for(int i=max(r+1,s);i<=ans;i++)cout<<"all -> ins2 "<<i<<endl;
	for(int i=l;i<=p;i++)A.ins(a[i],c[i]);
	for(int i=max(r+1,s);i<max(ans,s);i++)A.ins(b[i],c[i]);
	solve(p+1,r,max(ans,s),t);
}

signed main(void){

#ifndef ONLINE_JUDGE
	freopen("q.in","r",stdin);
#endif

	n=read(),k=read(),E=read();
	for(int i=1;i<=n;i++)c[i]=read(),a[i]=read(),b[i]=read();

	int L=1,R=n,p=0;
	A.init();
	while(L<=R){
		int mid=(L+R)>>1;
		// cout<<"mid = "<<mid<<endl;
		auto B=A;
		for(int i=L;i<mid;i++)B.ins(a[i],c[i]);
		for(int i=mid;i<=R;i++)B.ins(b[i],c[i]);
		if(B.valid()){
			for(int i=L;i<=mid;i++)A.ins(a[i],c[i]);
			L=mid+1,p=mid;
		}
		else{
			for(int i=mid;i<=R;i++)A.ins(b[i],c[i]);
			R=mid-1;
		}
	}
	// cout<<"p = "<<p<<endl;
	for(int i=p+1;i<=n;i++)res[i]=n+1;

	A.init();
	solve(1,p,1,n);

	ll ans=0;
	for(int i=1;i<=n;i++)ans+=n-res[i]+1;
	cout<<ans<<endl;

	return 0;
}