#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int n,V,M;
const int N = 1010;
int v[N],w[N],m[N];
int f[N][N];
int main()
{
cin>>n>>V>>M;
for(int i = 1;i<=n;i++) cin>>v[i]>>m[i]>>w[i];
for(int i = 1;i<=n;i++)
for(int j = V;j>=v[i];j--)
for(int k = M;k>=m[i];k--)
f[j][k] = max(f[j][k],f[j-v[i]][k-m[i]] + w[i]);
cout << f[V][M];
return 0;
}