#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, x) for(int i = (a); i < (int)(x); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long

int main() {
    int N, W, D;
    cin >> N >> W >> D;

    vector<int> type(N), weight(N);
    vector<ll> value(N);
    rep(i, 0, N) {
        cin >> type[i] >> weight[i] >> value[i];
    }

    const ll INF = 1e9 + 7; 
    vector<ll> dp0(W + 1, -INF), dp1(W + 1, -INF);
    dp0[0] = 0;
    dp1[0] = 0;

    rep(i, 0, N) {
        if (type[i] == 0) {
            for (int j = W; j >= weight[i]; j--) {
                dp0[j] = max(dp0[j], dp0[j - weight[i]] + value[i]);
            }
        } else {
            for (int j = W; j >= weight[i]; j--) {
                dp1[j] = max(dp1[j], dp1[j - weight[i]] + value[i]);
            }
        }
    }

    ll result = 0;
    rep(x, 0, W + 1) {
        rep(y, 0, W + 1) {
            if (x + y <= W && abs(x - y) <= D) {
                if (dp0[x] != -INF && dp1[y] != -INF) {
                    result = max(result, dp0[x] + dp1[y]);
                }
            }
        }
    }

    cout << result << endl;
    return 0;
}