#include <bits/stdc++.h>

#define mp make_pair
#define mt make_tuple
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long, long> pll;

const int INF = 1 << 29;
const double EPS = 1e-9;
const int MOD = 100000007;

const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
class Data {
public:
  int x, y, p;
  bool operator<(const Data &d) const {
    if (x == d.x){
      return y < d.y;
    }else{
    return x < d.x;
    }

  }
};
int main() {
  int n, b;
  cin >> n >> b;
  vector<Data> d(n);
  for (int i = 0; i < n; i++) {
    cin >> d[i].x >> d[i].y >> d[i].p;
  }
  sort(d.begin(), d.end());
  int ans = 0;
  for (int s = 0; s < n; s++) {
    for (int t = 0; t < n; t++) {
      int y1 = d[s].y;
      int y2 = d[t].y;
      int l = 0, r = 0;
      int sum = 0;
      int cnt = 0;
      int lastl,lastr;
      lastl = lastr = -1;
      while (1){
        while (r < n && sum <= b){
          if (sum <= b){
            ans = max(ans, cnt);
          }
          lastr = r;
          while (r < n&& d[lastr].x == d[r].x){
            if (y1 <= d[r].y && d[r].y <= y2){
              cnt++;
              sum += d[r].p;
            }
            r++;
          }
        }
        if (sum <= b)ans = max(ans, cnt);
        if (l >= r)break;
        lastl = l;
        while (l < n && d[lastl].x == d[l].x) {
          if (y1 <= d[l].y && d[l].y <= y2){
            cnt--;
            sum -= d[l].p;
          }
          l++;
        }
        if (sum <= b)ans = max(ans, cnt);
      }
      }
    }
    cout << ans << endl;

  return 0;
}