#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <iomanip>
#include <climits>
#include <cmath>
#include <functional>
#include <numeric>
#include <regex>
#include <array>
#include <fstream>
#include <sstream>

//#include<atcoder/modint>
//using namespace atcoder;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repl(i,l,r) for (int i = l; i < (int)(r); i++)
#define all(a) a.begin(),a.end()
#define Pii pair<int,int>
#define Pll pair<long,long>
#define INFi 1000000001
#define INFl 1000000000000000001
#define ll long long
using namespace std;



template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T> void printArray(vector<T>&A){
    for(T&a:A){
        cout<<a<<" ";
    }
    cout<<endl;
}
template<class T> void printArrayln(vector<T>&A){
    for(T&a:A){
        cout<<a<<endl;
    }
}


template<class T1,class T2> std::ostream &operator<<(std::ostream &out, const pair<T1,T2> &A){
    cout<<"{"<<A.first<<","<<A.second<<"}";
    return out;
}

template<class T1,class T2> std::ostream &operator<<(std::ostream &out, const map<T1,T2> &M){
    for(const auto&A:M){
        cout<<"{"<<A.first<<","<<A.second<<"}";
    }
    return out;
}

template<class T1> std::ostream &operator<<(std::ostream &out, const set<T1> &M){
    cout<<"{";
    for(const auto&A:M){
        cout<<A<<", ";
    }
    cout<<"}"<<endl;
    return out;
}


template<class T1> std::ostream &operator<<(std::ostream &out, const multiset<T1> &M){
    cout<<"{";
    for(const auto&A:M){
        cout<<A<<", ";
    }
    cout<<"}"<<endl;
    return out;
}

template<class T> std::ostream &operator<<(std::ostream &out, const vector<T> &A){
    for(const T &a:A){
        cout<<a<<" ";
    }
    return out;
}

void print() { cout << endl; }
 
template <typename Head, typename... Tail>
void print(Head H, Tail... T) {
  cout << H << " ";
  print(T...);
}


template<class T> std::istream &operator>>(std::istream &in,vector<T>&A){
    for(T&a:A){
        std::cin>>a;
    }
    return in;
}



int main(void){
    std::cin.tie(0)->sync_with_stdio(0);
    int N,W,D;cin>>N>>W>>D;
    vector<int> w1(0),v1(0);
    vector<int> w2(0),v2(0);
    rep(i,N){
        int t,w,d;cin>>t>>w>>d;
        if(t==0){
            w1.push_back(w);
            v1.push_back(d);
        }else{
            w2.push_back(w);
            v2.push_back(d);
        }
    }
    int N1 = w1.size();
    int N2 = w2.size();
    vector<vector<int>> dp1(N1+1,vector<int>(W+1,-1));
    vector<vector<int>> dp2(N2+1,vector<int>(W+1,-1));
    // dp[i][j] := i番目までみて重さがちょうどjのときの価値の最大値

    for(int i=1;i<=N1;i++){
        for(int j=0;j<=W;j++){
            if(j-w1[i-1]==0){
                dp1[i][j] = max(dp1[i][j],v1[i-1]);
            }else if(j-w1[i-1]>0){
                if(dp1[i-1][j-w1[i-1]]!=-1)
                    chmax(dp1[i][j],dp1[i-1][j-w1[i-1]]+v1[i-1]);
            }
            chmax(dp1[i][j],dp1[i-1][j]);
        }
    }

    for(int i=1;i<=N2;i++){
        for(int j=0;j<=W;j++){
            if(j-w2[i-1]==0){
                dp2[i][j] = max(dp2[i][j],v2[i-1]);
            }else if(j-w2[i-1]>0){
                if(dp2[i-1][j-w2[i-1]]!=-1)
                    chmax(dp2[i][j],dp2[i-1][j-w2[i-1]]+v2[i-1]);
            }
            chmax(dp2[i][j],dp2[i-1][j]);
        }
    }

    // 差がD以下になるように選ぶ
    int ans = 0;
    for(int i=0;i<=W;i++){
        for(int j=0;j<=W;j++){
            if(i+j<=W && abs(i-j)<=D && dp1[N1][i]!=-1 && dp2[N2][j]!=-1){
                chmax(ans,dp1[N1][i]+dp2[N2][j]);
            }
        }
    }
    cout<<ans<<endl;
}