#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
using p = pair<int, int>;


int main(){
    int n, w, d; cin >> n >> w >> d;
    vector<vector<p>> s(2);
    rep(i, n){
        int t, w, v; cin >> t >> w >> v;
        s[t].push_back({w, v}); 
    }
    vvi dp(2, vi(w+1, -1));
    dp[0][0] = dp[1][0] = 0;
    rep(i, 2){
        for(auto u : s[i]){
            drep(j, w+1){
                if(j-u.first<0)break;
                if(dp[i][j-u.first] == -1)continue;

                    dp[i][j] = max(dp[i][j], dp[i][j-u.first] + u.second);
                
            }
        }
    }
    int ans = 0;
    rep(i, w+1)rep(j, w+1){
        if(i+j > w)continue;
        if(abs(i-j) > d)continue;
        if(dp[0][i] == -1 || dp[1][j] == -1)continue;
        ans = max(ans, dp[0][i] + dp[1][j]);
    }cout << ans << endl;

    return 0;
}