#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<ll,ll> P;
typedef pair<int,P> PP;
const ll MOD=998244353;


int main(){
    int N,X,Y;
    cin>>N>>X>>Y;

    vector<ll> A(N),B(N),C(N);
    for(int i=0;i<N;i++){
        cin>>A[i]>>B[i]>>C[i];
    }

    vector<vector<ll>> dp(X+1,vector<ll>(Y+1,-INF));

    dp[0][0]=0;
    for(int i=0;i<N;i++){
        for(int x=X;x>=0;x--){
            for(int y=Y;y>=0;y--){
                if(x-A[i]>=0 && y-B[i]>=0 && dp[x-A[i]][y-B[i]]!=-INF){
                    dp[x][y]  = max(dp[x][y],dp[x-A[i]][y-B[i]]+C[i]);
                }
            }
        }
    }
    ll ans=-INF;
    for(int x=X;x>=0;x--){
        for(int y=Y;y>=0;y--){
            if(dp[x][y]!=-INF){
                ans=max(ans,dp[x][y]);
            }
        }
    }

    cout<<ans<<endl;


}