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

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>;
using vvi = vector<vi>;

struct Stone {
  int w;
  int v;
  Stone(int w, int v) : w(w), v(v) {}
};

int main() {
  int N, W, D;
  cin >> N >> W >> D;
  vector<Stone> s0, s1;
  rep(i, N) {
    int ti, wi, vi;
    cin >> ti >> wi >> vi;
    if (ti == 0)
      s0.push_back({wi, vi});
    if (ti == 1)
      s1.push_back({wi, vi});
  }
  int n0 = (int)s0.size();
  int n1 = (int)s1.size();
  vvi dp0(n0+1, vi (W+1, 0));
  vvi dp1(n1+1, vi (W+1, 0));
  auto f = [&](int n, int m, vvi & dp, vector<Stone> &s) {
    rep(i, n) {
      rep(j, m+1) {
	if (j >= s[i].w)
	  dp[i+1][j] = max(dp[i][j - s[i].w] + s[i].v, dp[i][j]);
	else
	  dp[i+1][j] = dp[i][j];
      }
    }
  };
  f(n0, W, dp0, s0);
  f(n1, W, dp1, s1);
  int m = 0;
  rep(i, W+1) rep(j, W+1-i) {
    if (abs(dp0[n0][i] - dp1[n1][j]) <= D)
      m = max(dp0[n0][i] + dp1[n1][j], m);
  }
  cout << m << endl;
  return 0;
}