#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr ll mod = 998244353;

template<ll mod>
struct Mint {
  using M=Mint; ll v;
  M& put(ll x) { v=(x<mod)?x:x-mod; return *this; }
  Mint(ll x=0) { put(x%mod+mod); }
  M operator+(M m) {return M().put(v+m.v);}
  M operator-(M m) {return M().put(v+mod-m.v);}
  M operator*(M m) {return M().put(v*m.v%mod);}
  M operator/(M m) {return M().put(v*m.inv().v%mod);}
// BEGIN IGNORE
  M operator+=(M m) { return put(v+m.v); }
  M operator-=(M m) { return put(v+mod-m.v); }
  M operator*=(M m) { return put(v*m.v%mod); }
  M operator/=(M m) { return put(v*m.inv().v%mod); }
// END IGNORE
  bool operator==(M m) { return v==m.v; }
  M pow(ll m) const {
    M x=v, res=1;
    while (m) {
      if (m&1) res=res*x;
      x=x*x; m>>=1;
    }
    return res;
  }
  M inv() { return pow(mod-2); }
};

using mint = Mint<mod>;

int main(){

  cin.tie(0);
  cin.sync_with_stdio(0);

  int n, w, d;
  cin >> n >> w >> d;
  vector<int> t(n), a(n), v(n);
  for(int i = 0; i < n; ++i){
    cin >> t[i] >> a[i] >> v[i];
  }
  vector<pair<int,int>> t0, t1;
  for(int i = 0; i < n; ++i){
    if(t[i] == 0)t0.emplace_back(a[i], v[i]);
    if(t[i] == 1)t1.emplace_back(a[i], v[i]);
  }
  auto f = [&](vector<pair<int,int>> a){
    vector<int> dp(w + 1, -1e9);
    dp[0] = 0;
    for(int i = 0; i < a.size(); ++i){
      auto nex = dp;
      auto [wei, val] = a[i];
      for(int j = 0; j <= w; ++j){
        if(j + wei <= w)nex[j + wei] = max(nex[j + wei], dp[j] + val);
      }
      swap(dp, nex);
    }
    return dp;
  };
  auto r1 = f(t0);
  auto r2 = f(t1);
  int ans = 0;
  for(int i = 0; i <= w; ++i){
    for(int j = 0; i + j <= w; ++j){
      if(abs(i - j) <= d)
        ans = max(ans, r1[i] + r2[j]);
    }
  }
  cout << ans << endl;
}