#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;
int n, m, lim, v[N], a[N], b[N], mn[N], top;
vector<int> f[N];
typedef long long ll;
ll ans;

void create() {
    top++;
    f[top].resize(m + 1);
    for (int i = 0; i <= m; i++) {
        f[top][i] = f[top - 1][i];
    }
}
void erase() {
    top--;
}
void update(int c, int v) {
    for (int i = m; i >= c; i--) {
        f[top][i] = max(f[top][i], f[top][i - c] + v);
    }
}
bool check() {
    ll res = 0;
    for (int i = 1; i <= m; i++) {
        res += f[top][i];
    }
    return res <= 1ll * lim * m;
}
void small(int l, int r) {
    for (int i = l; i <= r; i++) {
        update(a[i], v[i]);
    }
}
void big(int l, int r) {
    for (int i = l; i <= r; i++) {
        update(b[i], v[i]);
    }
}

void divide(int l, int r, int L, int R) {
    if (l > r) return;
    create();
    int M = (L + R) >> 1;
    big(max(l, L), M);
    small(max(l, M + 1), R);
    int tl = l, tr = r, res = l - 1;
    while (tl <= tr) {
        create();
        int mid = (tl + tr) >> 1;
        big(mid, tr);
        small(tl, mid - 1);
        if (check()) {
            erase();
            small(tl, mid);
            res = mid;
            tl = mid + 1;
        } else {
            erase();
            big(mid, tr);
            tr = mid - 1;
        }
    }
    if (L == R) {
        for (int i = l; i <= res; i++) {
            mn[i] = L;
        }
        for (int i = res + 1; i <= r; i++) {
            mn[i] = n + 1;
        }
        return;
    }
    erase();
    create();
    small(M + 1, R);
    big(res + 1, min(r, L - 1));
    divide(l, res, L, M);
    erase();
    create();
    small(l, res);
    big(max(L, r + 1), M);
    divide(res + 1, r, M + 1, R);
    erase();
}

int main() {
    scanf("%d%d%d", &n, &m, &lim);
    for (int i = 1; i <= n; i++) {
        scanf("%d%d%d", &v[i], &a[i], &b[i]);
    }
    for (int i = 0; i <= m; i++) {
        f[0].push_back(0);
    }
    divide(1, n, 1, n);
    for (int i = 1; i <= n; i++) {
        ans += n - mn[i] + 1;
    }
    printf("%lld\n", ans);
    return 0;
}