#include <bits/stdc++.h>
// #include <atcoder/all>
#include <iostream>
#include <math.h>

using namespace std;
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using ll = long long;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, f, n) for (int i = (int) f; i < (int)(n); i++)
#define repd(i, n, l) for (int i = (int) n; i >= (int) l; i--)

const ll inf = ll(1e9+7);

int N, W, D;

vector<ll> solve(vector<pair<int, int>> A){
    int n = A.size();
    vector<ll> dp(W+1, -inf);
    dp[0] = 0;
    rep(i, n){
        int w = A[i].first;
        int v = A[i].second;
        vector<ll> ndp(W+1, -inf);
        rep(j, W+1){
            ndp[j] = max(dp[j], ndp[j]);
            if (j + w <= W) ndp[j+w] = max(ndp[j+w], dp[j] + v);
        }
        swap(ndp, dp);
    }
    return dp;
}

int main() {
    cin >> N >> W >> D;
    vector<pair<int, int>> A;
    vector<pair<int, int>> B;
    rep(_, N){
        int t, w, v;
        cin >> t >> w >> v;
        if (t == 0) A.push_back({w, v});
        else B.push_back({w, v}); 
    }
    vector<ll> dp1 = solve(A);
    vector<ll> dp2 = solve(B);
    ll ans = 0;
    rep(j, W+1) rep(jj, W+1){
        if (j + jj <= W && abs(j-jj)<=D) ans = max(ans, dp1[j] + dp2[jj]);
    }
    cout << ans << endl;
    return 0;
}