#include #include using namespace std; using namespace atcoder; #define rep(i,a,b) for(it i=(it)(a);i<=(it)b;i++) #define nrep(i,a,b) for(it i=(it)(a);i>=(it)b;i--) #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define moda 998244353LL #define modb 1000000007LL #define dai 2500000000000000000LL #define tyu 2500000000 #define en 3.14159265358979 #define sho -dai #define eps 1e-14 #define yn(x) cout<<(x ? "Yes":"No")<; using mint=modint; using vi=vector; using vd=vector; using vs=vector; using vc=vector; using vb=vector; using vp=vector

; using vm=vector; using sp=set

; using ss=set; using sc=set; using si=set; using vvi=vector; using vvd=vector; using vvs=vector; using vvb=vector; using vvc=vector; using vvp=vector; using vvm=vector; using vsi=vector; using vsp=vector; using vvsi=vector; using vvsp=vector; using vvvi=vector; using vvvd=vector; using vvvvi=vector; int main(){ it n,x,y;cin>>n>>x>>y; vi a(n),b(n),c(n); rep(i,0,n-1)cin>>a[i]>>b[i]>>c[i]; vvvi dp(n+1,vvi(x+1,vi(y+1,sho))); dp[0][0][0]=0; rep(i,0,n-1) rep(j,0,x) rep(k,0,x){ dp[i+1][j][k]=max(dp[i+1][j][k],dp[i][j][k]); if(a[i]+j<=x&&b[i]+k<=y) dp[i+1][j+a[i]][k+b[i]]=max(dp[i+1][j+a[i]][k+b[i]],dp[i][j][k]+c[i]); } it ans=0; rep(i,0,x) rep(j,0,x) ans=max(ans,dp[n][i][j]); cout<