#include <bits/stdc++.h> using namespace std; void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); } int main() { fast_io(); int n, W, D; cin >> n >> W >> D; vector<int> t(n), w(n), v(n); for (int i = 0; i < n; i++) { cin >> t[i] >> w[i] >> v[i]; } vector<int> dp1(W + 1, -1e9), dp2(W + 1, -1e9); dp1[0] = dp2[0] = 0; for (int i = 0; i < n; i++) { for (int j = W; j >= 0; j--) { if (j + w[i] <= W) { if (t[i] == 0) { dp1[j + w[i]] = max(dp1[j + w[i]], dp1[j] + v[i]); } else { dp2[j + w[i]] = max(dp2[j + w[i]], dp2[j] + v[i]); } } } } int ans = 0; for (int i = 0; i <= W; i++) { for (int j = 0; j <= W; j++) { if (i + j <= W && i - j <= D && j - i <= D) { ans = max(ans, dp1[i] + dp2[j]); } } } cout << ans << endl; }