#include <bits/stdc++.h>

using namespace std;
using ll = long long;
constexpr int INF = (1u << 31) - 1;

int main() {
  // 二回DPをして
  int N, W, D;
  cin >> N >> W >> D;
  vector<ll> t(N), w(N), v(N);
  for (int i = 0; i < N; i++)
    cin >> t[i] >> w[i] >> v[i];
  // dp(1,2)[i][j]:=iまで見て重量jの時の最大の価値
  vector dp(2, vector(N + 1, vector<ll>(W + 1, -INF)));
  dp[0][0][0] = dp[1][0][0] = 0;
  for (int i = 0; i < N; i++) {
    dp[0][i + 1] = dp[0][i];
    dp[1][i + 1] = dp[1][i];
    if (t[i] == 0) {
      for (int j = 0; j < W; j++) {
        if (dp[0][i][j] < 0) continue;
        if (j + w[i] > W) continue;
        dp[0][i + 1][j + w[i]] =
            max(dp[0][i + 1][j + w[i]], dp[0][i][j] + v[i]);
        // cout << "dp[0]" << dp[0][i][j] + v[i] << endl;
      }
    } else {
      for (int j = 0; j < W; j++) {
        if (dp[1][i][j] < 0) continue;
        if (j + w[i] > W) continue;
        dp[1][i + 1][j + w[i]] =
            max(dp[1][i + 1][j + w[i]], dp[1][i][j] + v[i]);
        // cout << "dp[1]" << dp[1][i][j] + v[i] << endl;
      }
    }
  }

  // dp[0,1][N][1-W]を使う
  // 0のWを全探索→+-Dの範囲で全探索
  ll ans{-1};
  for (int i = 0; i <= W; i++) {
    for (int j = 0; j <= W; j++) {
      if (i + j > W || abs(i - j) > D) continue;
      ans = max(ans, dp[0][N][i] + dp[1][N][j]);
    }
  }
  cout << ans << endl;
}