import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, B;
int[] X, Y, P;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      B = readInt();
      X = new int[N];
      Y = new int[N];
      P = new int[N];
      foreach (i; 0 .. N) {
        X[i] = readInt();
        Y[i] = readInt();
        P[i] = readInt();
      }
      
      auto xs = X.dup.sort.uniq.array;
      auto ys = Y.dup.sort.uniq.array;
      const xsLen = cast(int)(xs.length);
      const ysLen = cast(int)(ys.length);
      auto cnt = new int[][](xsLen + 1, ysLen + 1);
      auto sum = new int[][](xsLen + 1, ysLen + 1);
      foreach (i; 0 .. N) {
        const e = xs.lowerBound(X[i]);
        const f = ys.lowerBound(Y[i]);
        cnt[e + 1][f + 1] += 1;
        sum[e + 1][f + 1] += P[i];
      }
      foreach (e; 0 .. xsLen) foreach (f; 0 .. ysLen) {
        cnt[e + 1][f + 1] += cnt[e][f + 1];
        sum[e + 1][f + 1] += sum[e][f + 1];
      }
      foreach (e; 0 .. xsLen) foreach (f; 0 .. ysLen) {
        cnt[e + 1][f + 1] += cnt[e + 1][f];
        sum[e + 1][f + 1] += sum[e + 1][f];
      }
      
      int ans;
      foreach (ea; 0 .. xsLen) foreach (eb; ea + 1 .. xsLen + 1) {
        for (int fa = 0, fb = 1; fb <= ysLen; ++fb) {
          for (; sum[ea][fa] - sum[ea][fb] - sum[eb][fa] + sum[eb][fb] > B; ++fa) {}
          chmax(ans, cnt[ea][fa] - cnt[ea][fb] - cnt[eb][fa] + cnt[eb][fb]);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}