#include <bits/stdc++.h>
using namespace std;
#define ll long long
namespace IO {
	#if ONLINE_JUDGE
	#define getc() (IS == IT && (IT = (IS = ibuf) + fread(ibuf, 1, IL, stdin), IS == IT) ? EOF : *IS++)
	#else
	#define getc() getchar()
	#endif
	const int IL = 1 << 21, OL = 1 << 21;
	int olen = 0;
	char ibuf[IL], *IS = ibuf, *IT = ibuf, obuf[OL];
	inline int read() {
		register char ch = getc(); register int x = 0, f = 1;
		while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getc(); }
		while(isdigit(ch)) x = x * 10 + ch - 48, ch = getc();
		return x * f;
	}
	inline double readdb() {
		register char ch = getc(); register double x = 0, f = 1;
		while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getc(); }
		while(isdigit(ch)) x = x * 10 + ch - 48, ch = getc();
		if(ch == '.') {
			register double b = 0.1;
			ch = getc();
			while(isdigit(ch)) x += (ch - 48) * b, b *= 0.1, ch = getc();
		}
		return x * f;
	}
	inline int readstr(char *s) {
		register char ch = getc(); register int len = 0;
		while(!isalpha(ch)) ch = getc();
		while(isalpha(ch)) s[++len] = ch, ch = getc();
		return len;
	}
	inline void flush() { fwrite(obuf, 1, olen, stdout); olen = 0; }
	inline void putc(register char ch) { obuf[olen++] = ch; }
	template<class T>
	inline void write(register T x) {
		if(x < 0) obuf[olen++] = '-', x = -x;
		if(x > 9) write(x / 10);
		obuf[olen++] = x % 10 + 48;
	}
} using namespace IO;
const int N = 2e5 + 10;
int n, k, E, v[N], a[N], b[N], ans[N];
inline bool chk(vector<int> &f) {
	ll res = 0;
	for(int i = 1; i <= k; i++) res += f[i];
	return res <= 1ll * E * k;
}
inline void add(vector<int> &f, int w, int v) {
	for(int i = k; i >= w; i--)
		f[i] = max(f[i], f[i - w] + v);
}

void solve(int l, int r, int L, int R, vector<int> &f) {
//	cout << L << " " <<R <<endl;
	assert(l <= L && r <= R);
//	cout << l << " " <<r << " " << L <<  ' ' << R << endl;
//	if(L==1&&R==3) {
//		cout << f[1] << ' ' << f[2] << " " <<f[3] << " " << f[4] << ' '<<f[5]<<endl;
//	}
	if(l > r || L > R) return;
	if(L == R) { for(int i = l; i <= r; i++) ans[i] = min(ans[i], L); return; }
	int Mid = L + R >> 1;
	vector<int> g = f, h = f;
	for(int i = Mid + 1; i <= R; i++) add(f, a[i], v[i]);
	for(int i = max(r + 1, L); i <= Mid; i++)
		add(f, b[i], v[i]);
//	puts(""); 
	int l1 = l, r1 = min(r, Mid), mid, ans = l - 1;
//	cout << l1 << " " << r1 << " " << Mid + 1 << " " << R << " " << max(r + 1, L) << " " << Mid << " " << l << " " << r << " " << L << " " << R << endl;
	while(l1 <= r1) {
		mid = l1 + r1 >> 1;
		g = f;
		for(int i = l1; i < mid; i++)
			add(g, a[i], v[i]);
		for(int i = mid; i <= r1; i++)
			add(g, b[i], v[i]);
		if(chk(g)) {
			for(int i = l1; i <= mid; i++)
				add(f, a[i], v[i]);
			l1 = mid + 1, ans = mid;
		}
		else {
			for(int i = mid; i <= r1; i++)
				add(f, b[i], v[i]);
			r1 = mid - 1;
		}
	}
	if(ans != l - 1) ::ans[ans] = min(::ans[ans], Mid); 
	f = h, g = h;
	for(int i = l; i <= r; i++) {
		if((l <= i && i <= ans) || (L <= i && i <= Mid)) continue;
//		cout << i << endl; 
		if(i < l) add(f, a[i], v[i]);
		else if(i > Mid) add(f, a[i], v[i]);
		else if(i > ans && i < L) add(f, b[i], v[i]);
		else add(f, b[i], v[i]), assert(0);
	}
	for(int i = max(L, r + 1); i <= R; i++) {
		if((l <= i && i <= ans) || (L <= i && i <= Mid)) continue;
//		cout << i << endl;
		if(i < l) add(f, a[i], v[i]);
		else if(i > Mid) add(f, a[i], v[i]);
		else if(i > ans && i < L) add(f, b[i], v[i]);
		else add(f, b[i], v[i]), assert(0);
	}
	solve(l, ans, L, Mid, f);
	for(int i = l; i <= r; i++) {
		if((ans + 1 <= i && i <= r) || (Mid + 1 <= i && i <= R)) continue;
		if(i < ans + 1) add(g, a[i], v[i]);
		else if(i > R) add(g, a[i], v[i]);
		else if(i > r && i < Mid + 1) add(g, b[i], v[i]);
		else add(g, b[i], v[i]), assert(0);
	}
	for(int i = max(L, r + 1); i <= R; i++) {
		if((ans + 1 <= i && i <= r) || (Mid + 1 <= i && i <= R)) continue;
		if(i < ans + 1) add(g, a[i], v[i]);
		else if(i > R) add(g, a[i], v[i]);
		else if(i > r && i < Mid + 1) add(g, b[i], v[i]);
		else add(g, b[i], v[i]), assert(0);
	}
	solve(ans + 1, r, Mid + 1, R, g);
}
int main() {
//	if(system("fc my.out std.out")) return 0;
//	freopen("ex_backpack4.in", "r", stdin);
//	freopen("my.out", "w", stdout);
	memset(ans, 0x3f, sizeof(ans));
	n = read(), k = read(), E = read();
//	cout << n <<" " << k << endl;
	for(int i = 1; i <= n; i++) {
		v[i] = read(), a[i] = read(), b[i] = read();
	}
	vector<int> vc;
	vc.resize(k + 2);
	solve(1, n, 1, n + 1, vc);
	ll res = 0;
	for(int i = 1; i <= n; i++)
		if(ans[i] <= n) res += n - ans[i] + 1/*, cout << i << " " << ans[i] << endl*/;
	printf("%lld\n", res);
	return 0;
}