#include<iostream>
using namespace std;
const int N = 1100;
int n, v, m;
int f[N][N];

int main()
{
    cin >> n >> v >> m;
    for(int i = 1; i <= n; ++ i)
    {
        int a, b, c;
        cin >> a >> b >> c;
        for(int j = v; j >= a; -- j)
        {
            for(int k = m; k >= b; -- k)
            {
                f[j][k] = max(f[j][k], f[j - a][k - b] + c);
            }
        }
    }
    cout << f[v][m] << endl;
    return 0;
}