#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, w, d;
  cin >> n >> w >> d;
  vector<int> dp0(w + 1, -1), dp1(w + 1, -1);
  dp0[0] = dp1[0] = 0;
  rep(_, n) {
    int t, wi, vi;
    cin >> t >> wi >> vi;
    auto& dp = t ? dp1 : dp0;
    rrep(i, w - wi + 1) if (dp[i] != -1) chmax(dp[i + wi], dp[i] + vi);
  }
  int ans = 0;
  segtree<int, [](int x, int y) { return max(x, y); }, []() { return -1; }> seg(dp1);
  rep(i, w + 1) if (dp0[i] != -1) {
    int li = max(0, i - d), ri = min(w - i, i + d);
    if (li <= ri) {
      int mx = seg.prod(li, ri + 1);
      if (mx != -1) chmax(ans, dp0[i] + mx);
    }
  }
  cout << ans << '\n';
}