#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, s;
    cin >> n >> s;
    vector < vector < long long > > all(n);
    for (int i = 0; i < n; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        all[i] = {a, -c, b};
    }
    sort(all.begin(), all.end());
    long long l = 0, r = n + 1;
    while (l + 1 < r) {
        long long m = (l + r) / 2;
        long long curs = 0;
        for (int i = 0; i < m; i++) {
            if (m <= -all[i][1]) curs += all[i][0];
            else curs += all[i][2];
        }
        if (curs > s) r = m;
        else l = m;
    }
    cout << l;
    return 0;
}