#include <stdio.h>
#include <string.h>

typedef long long ll;

int v[200007], a[200007], b[200007], pos[200007], dp[10000007];

inline int max(int a, int b){
	return a > b ? a : b;
}

inline void insert(int v, int w, int k){
	for (register int i = k; i >= v; i--){
		dp[i] = max(dp[i], dp[i - v] + w);
	}
}

void solve(int l1, int r1, int l2, int r2, int k, ll limit){
	if (l2 == r2){
		for (register int i = l1; i <= r1; i++){
			pos[i] = l2;
		}
		return;
	}
	int mid = (l1 + r1) >> 1, L = max(l2, mid), R = r2, llst = mid, rlst = r2, *save = new int[k + 1];
	memcpy(save, dp, sizeof(int) * (k + 1));
	for (register int i = l1; i < mid; i++){
		insert(a[i], v[i], k);
	}
	pos[mid] = mid - 1;
	while (L <= R){
		int _mid = (L + R) >> 1, *_save = new int[k + 1];
		ll sum = 0;
		memcpy(_save, dp, sizeof(int) * (k + 1));
		for (register int i = llst; i <= _mid; i++){
			insert(b[i], v[i], k);
		}
		for (register int i = _mid + 1; i <= rlst; i++){
			insert(a[i], v[i], k);
		}
		for (register int i = 1; i <= k; i++){
			sum += dp[i];
		}
		if (sum <= limit){
			R = _mid - 1;
			memcpy(dp, _save, sizeof(int) * (k + 1));
			for (register int i = _mid + 1; i <= rlst; i++){
				insert(a[i], v[i], k);
			}
			rlst = _mid;
		} else {
			L = _mid + 1;
			pos[mid] = _mid;
			memcpy(dp, _save, sizeof(int) * (k + 1));
			for (register int i = llst; i <= _mid; i++){
				insert(b[i], v[i], k);
			}
			llst = _mid + 1;
		}
		delete _save;
	}
	if (l1 < mid){
		memcpy(dp, save, sizeof(int) * (k + 1));
		for (register int i = pos[mid] + 1; i <= r2; i++){
			insert(a[i], v[i], k);
		}
		solve(l1, mid - 1, l2, pos[mid], k, limit);
	}
	if (r1 > mid){
		memcpy(dp, save, sizeof(int) * (k + 1));
		for (register int i = l1; i <= mid; i++){
			insert(a[i], v[i], k);
		}
		solve(mid + 1, r1, pos[mid], r2, k, limit);
	}
	memcpy(dp, save, sizeof(int) * (k + 1));
	delete save;
}

int main(){
	int n, k, e;
	ll limit, ans = 0;
	scanf("%d %d %d", &n, &k, &e);
	limit = (ll)k * e;
	for (register int i = 1; i <= n; i++){
		scanf("%d %d %d", &v[i], &a[i], &b[i]);
	}
	solve(1, n, 0, n, k, limit);
	for (register int i = 1; i <= n; i++){
		ans += n - pos[i];
	}
	printf("%lld", ans);
	return 0;
}