#include <iostream>

#define MAX_N 5100
#define INF 1e9

long long dp[MAX_N][MAX_N][2];

int main(void) {
    int n, w, d;
    long long tn[MAX_N], wn[MAX_N], vn[MAX_N];
    std::cin >> n >> w >> d;
    for (int i=0; i<n; i++)
        std::cin >> tn[i] >> wn[i] >> vn[i];

    for (int i=0; i<MAX_N; i++)
        for(int j=0; j<MAX_N; j++)
            for (int k=0; k<2; k++) 
                dp[i][j][k] = INF;

    dp[0][0][0] = 0;
    dp[0][0][1] = 0;
    for (int i=0; i<n; i++) {
        for (int v=0; v<MAX_N; v++) {
            int t = tn[i];
            if(v-vn[i] >= 0) {
                if (dp[i+1][v][t]+dp[i+1][v][(t+1)%2] > dp[i][v-vn[i]][t]+dp[i][v-vn[i]][(t+1)%2]+wn[i]) {
                    dp[i+1][v][t] = dp[i][v-vn[i]][t]+wn[i];
                    dp[i+1][v][(t+1)%2] = dp[i][v-vn[i]][(t+1)%2];
                }
            } else {
                if (dp[i+1][v][t]+dp[i+1][v][(t+1)%2] > dp[i][v][t]+dp[i][v][(t+1)%2]) {
                    dp[i+1][v][t] = dp[i][v][t];
                    dp[i+1][v][(t+1)%2] = dp[i][v][(t+1)%2];
                }
            }
        }
    }

    long long ans = 0;
    for (int v=0; v<MAX_N; v++) {
        if (dp[n][v][0]+dp[n][v][1] <= w && std::abs(dp[n][v][0]-dp[n][v][1]) <= d)
            ans = v;
    }
    std::cout << ans << std::endl;
}