#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;
using PLLL = pair <pair <ll,ll>,ll>;
int N;
ll B;
vector <PLLL> XY;

int solve(int i, int j){
  vector <pair <ll,ll> > nums;//y,p
  for (int x = i; x <= j; x++) {
    if (XY[x].fir.sec >= XY[i].fir.sec) {
      nums.pb(mp(XY[x].fir.sec,XY[x].sec));
    }
  }
  sort(ALL(nums));
  int ans = 0;
  ll now = 0;
  int start = 0;
  int n = sz(nums);
  for (int k = 0; k < n; k++) {
    now += nums[k].sec;
    if (now > B) {
      for (;start <= k;start++) {
        now -= nums[start].sec;
        if (now <= B) {
          break;
        }
      }
      start += 1;
      ans = max(ans, k - start + 1);
    }else{
      ans = max(ans, k - start + 1);
    }
  }
  return ans;
}


int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);

  cin >> N >> B;
  rep(i,N){
    ll x,y,z;
    cin >> x >> y >> z;
    XY.pb(mp(mp(x,y),z));
  }
  sort(ALL(XY));
  int ans = 0;
  rep(i,N){
    if (XY[i].sec <= B) {
      ans = max(ans,1);
    }
    rep2(j,i+1,N){
      ans = max(ans,solve(i,j));
    }
  }
  cout << ans << endl;
  
  return 0;
}