#include <bits/stdc++.h>
using ll = long long;
#define int ll
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, int(n) + 1)
#define all(c) begin(c), end(c)
const int MOD = 1000000007;

template <typename T>
void __print__(std::ostream &os, const char *, const char *tail, const T &fst) {
    os << fst << tail;
}
template <typename Fst, typename... Rst>
void __print__(std::ostream &os, const char *del, const char *tail, const Fst &fst,
               const Rst &... rst) {
    os << fst << del;
    __print__(os, del, tail, rst...);
}

#ifdef LOCAL
#define dump(...)                                         \
    do {                                                  \
        std::ostringstream os;                            \
        os << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; \
        __print__(os, ", ", "\n", __VA_ARGS__);           \
        std::cerr << os.str();                            \
    } while (0)
#else
#define dump(...)
#endif

template <typename Fst, typename... Rst>
void println(const Fst &fst, const Rst &... rst) {
    __print__(std::cout, "\n", "\n", fst, rst...);
}
template <typename Fst, typename... Rst>
void print(const Fst &fst, const Rst &... rst) {
    __print__(std::cout, " ", "\n", fst, rst...);
}

template <typename iter>
void println_(iter bgn, iter end) {
    while (bgn != end) println(*bgn++);
}

template <typename iter>
void print_(iter bgn, iter end) {
    while (bgn != end) {
        std::cout << *bgn++;
        std::cout << (bgn == end ? "\n" : " ");
    }
}

int _ = (std::cout.precision(10), std::cout.setf(std::ios::fixed), std::cin.tie(0),
         std::ios::sync_with_stdio(0), 0);

template <typename T>
std::vector<T> ndarray(int n, T v) {
    return std::vector<T>(n, v);
}
template <typename... Args>
auto ndarray(int n, Args... args) {
    auto val = ndarray(args...);
    return std::vector<decltype(val)>(n, move(val));
}

template <typename T>
bool umax(T &a, const T &b) {
    return a < b ? a = b, true : false;
}

template <typename T>
bool umin(T &a, const T &b) {
    return a > b ? a = b, true : false;
}

using namespace std;

int N, C;
int a[101], b[101], c[101];

int dp[2][10001][101]; // A?????????????????¨ -> B????????????max

const int INF = 1e18;

int solve() {
    fill((int*)begin(dp), (int*)end(dp), -INF);
    dp[0][0][0] = 0;
    rep(i, N) {
        auto cur = dp[i&1];
        auto nxt = dp[~i&1];
        memcpy(nxt, cur, sizeof(dp[0]));
        rep(j, 10001) {
            rep(k, 101) {
                if (k + c[i] <= C) {
                    // use for A
                    if (j + a[i] <= 10000) {
                        umax(nxt[j + a[i]][k + c[i]], cur[j][k] + b[i]);
                    }
                    // use for B
                    if (j + b[i] <= 10000) {
                        umax(nxt[j + b[i]][k + c[i]], cur[j][k] + a[i]);
                    }
                }
            }
        }

        // cout << "===" << endl;
        // rep(i, 10) {
        //     rep(j, 10) {
        //         cout << nxt[i][j] << ' ';
        //     }
        //     cout << endl;
        // }
    }

    int ans = 0;
    rep(i, 10001) {
        rep(j, C + 1) {
            ans = max(ans, min(i, dp[N&1][i][j]));
        }
    }
    return ans;
}

signed main() {
    while (cin >> N >> C) {
        rep(i, N) cin >> a[i] >> b[i] >> c[i];
        print(solve());
    }
}

Measured memory_bytes: 18936