#define _CRT_SECURE_NO_WARNINGS
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
template<class T> istream & operator>>(istream & is, vector<T> &);
template<class T> ostream & operator<<(ostream & os, vector<T> const &);
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream & os, tuple<T...> const & t){ _ot<0>(os, t); return os; }
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _it(istream &, tuple<T...> &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _it(istream & is, tuple<T...> & t){ is >> get<n>(t); _it<n+1>(is, t); }
template<class...T> istream & operator>>(istream & is, tuple<T...> & t){ _it<0>(is, t); return is; }
template<class T, class U> istream & operator<<(istream & is, pair<T,U> & p){ return is >> p.first >> p.second; }
template<class T, class U> ostream & operator<<(ostream & os, pair<T,U> const & p){ return os << "(" << p.first << ", " << p.second << ") "; }
template<class T> istream & operator>>(istream & is, vector<T> & v){ rep(i,v.size()) is >> v[i]; return is; }
template<class T> ostream & operator<<(ostream & os, vector<T> const & v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; }
#ifdef DEBUG
#define dump(...) (cerr<<#__VA_ARGS__<<" = "<<mt(__VA_ARGS__)<<" ["<<__LINE__<<"]"<<endl)
#else
#define dump(...)
#endif

typedef complex<int> P;

namespace std {
    bool operator<(P const & a, P const & b){
        return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();
    }
}

int main(){
    int N,B;
    while(cin >> N >> B){
        vector<pair<P,int>> ps(N);
        rep(i,N){
            int x,y,p;
            cin >> x >> y >> p;
            ps[i] = mp(P(x,y),p);
        }
        sort(all(ps));
        ll ans = 0;
        rep(i,N){
            for(int j=i+1;j<=N;j++){
                vector<pair<int,int>> ys;
                loop(k,i,j){
                    ys.eb(ps[k].first.imag(),ps[k].second);
                }
                sort(all(ys), [](const pair<P,int> & a, const pair<P,int> & b){
                        int y1 = a.first.imag(), y2 = b.first.imag();
                        return y1 < y2;
                    });
                ll cur = 0;
                int ir = 0;
                rep(il,ys.size()){
                    while(ir < (int)ys.size() && cur+ys[ir].second <= B){
                        cur += ys[ir].second;
                        ir++;
                    }
                    while(ir+1 < (int)ys.size() && ys[ir].second == ys[ir+1].second){
                        cur += ys[ir].second;
                        ir++;
                    }
                    if(cur <= B) ans = max(ans,ir-il);
                    cur-= ys[il].second;
                }
            }
        }
        cout << ans << endl;
    }
}