#include <bits/stdc++.h>
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
#define rreps(i, n) for(int i=((int)(n)); i>0; --i)
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
using vs = vector<string>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T>bool chmaxeq(T &a, const T &b) { if (a<=b) { a=b; return 1; } return 0; }
template<class T>bool chmineq(T &a, const T &b) { if (b<=a) { a=b; return 1; } return 0; }
bool yes(bool a) { cout << (a?"yes":"no") << endl; return a; }
bool Yes(bool a) { cout << (a?"Yes":"No") << endl; return a; }
bool YES(bool a) { cout << (a?"YES":"NO") << endl; return a; }
void _main();
int main() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(16); _main(); return 0; }

ll INF = 1001001001;

void _main() {
	ll N, W, D; cin >> N >> W >> D;
	vl w0, v0, w1, v1;
	rep(i, N) {
		ll t, w, v; cin >> t >> w >> v;
		if (t == 0) {
			w0.push_back(w);
			v0.push_back(v);
		}
		else {
			w1.push_back(w);
			v1.push_back(v);
		}
	}
	ll N0 = w0.size();
	ll N1 = w1.size();
	vvl dp0(N0+1, vl(W+1, -INF)), dp1(N1+1, vl(W+1, -INF));
	dp0[0][0] = dp1[0][0] = 0;
	rep(i, N0) rep(j, W+1) {
		dp0[i+1][j] = dp0[i][j];
		if (j-w0[i] >= 0) chmax(dp0[i+1][j], dp0[i][j-w0[i]]+v0[i]);
	}
	rep(i, N1) rep(j, W+1) {
		dp1[i+1][j] = dp1[i][j];
		if (j-w1[i] >= 0) chmax(dp1[i+1][j], dp1[i][j-w1[i]]+v1[i]);
	}
	ll ans = 0;
	rep(i, W+1) rep(j, W+1) {
		if (abs(i-j) > D || i+j > W) continue;
		chmax(ans, dp0[N0][i]+dp1[N1][j]);
	}
	cout << ans << endl;
}