#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <memory>
using namespace std;

// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

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

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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

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

    vector dp(X + 1, vector<ll>(Y + 1, -1));
    dp[0][0] = 0;
    for(int i = 0; i < N; ++i){
        auto dp2 = dp;
        for(int j = 0; j + A[i] <= X; ++j){
            for(int k = 0; k + B[i] <= Y; ++k){
                if(dp[j][k] == -1)  continue;
                chmax(dp2[j + A[i]][k + B[i]], dp[j][k] + C[i]);
            }
        }
        dp = move(dp2);
    }

    ll ans = 0;
    for(int i = 0; i <= X; ++i){
        for(int j = 0; j <= Y; ++j){
            chmax(ans, dp[i][j]);
        }
    }

    cout << ans << endl;

    return 0;
}