#include <bits/stdc++.h>
#include <atcoder/all>

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using namespace std;
using namespace atcoder;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repll(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, n, m) for (int i = n; i < (int)(m); i++)
#define repll2(i, n, m) for (long long i = n; i < (long long)(m); i++)
#define all(v) v.begin(),v.end()
using ll=long long;
using ld=long double;
using vi=vector<int>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vvvl=vector<vvl>;
using vld=vector<ld>;
using vvld=vector<vld>;

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,1,-1};

const double PI = acos(-1);
//const ll MOD=1e9+7;
//const ll MOD=998244353;
const ll INF=(1LL<<60);
const int INF2=(1<<30);
//using mint=modint1000000007;
//using mint=modint998244353;

ll memo[301][301][301];
ll A[300],B[300],C[300];
int n;

ll dp(int i,int j,int k){
    if(memo[i][j][k]!=-1)return memo[i][j][k];
    if(j==0||k==0)return 0;
    if(i==n)return 0;
    ll ans=dp(i+1,j,k);
    if(j>=A[i]&&k>=B[i])ans=max(ans,dp(i+1,j-A[i],k-B[i])+C[i]);
    memo[i][j][k]=ans;
    return ans;
}



int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int x,y;cin>>n>>x>>y;
    memset(memo,-1,sizeof(memo));
    rep(i,n)cin>>A[i]>>B[i]>>C[i];
    cout<<dp(0,x,y)<<endl;
    return 0;
}