#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <tuple>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n, b;
int x[410], y[410], p[410];

int board[410][410];
int num[410][410];
int sum[410][410];
int nsum[410][410];

int psum(int i, int s, int t) {
    return sum[i][t+1] - sum[i][s];
}
int num_sum(int i, int s, int t) {
    return nsum[i][t+1] - nsum[i][s];
}

int calc(int s, int t) {
    int res = 0;
    int l = 0, r = 0, c = 0, d = 0;
    while (r < n) {
        while (r < n && c <= b) {
            c += psum(r, s, t);
            d += num_sum(r, s, t);
            if (c <= b) res = max(res, d);
            r++;
        }
        while (c > b) {
            c -= psum(l, s, t);
            d -= num_sum(l, s, t);
            l++;
        }
        res = max(res, d);
    }
    return res;
}

int solve() {
    vector<int> px(n), py(n);
    for (int i = 0; i < n; i++) {
        px[i] = x[i];
        py[i] = y[i];
    }
    sort(ALL(px));
    sort(ALL(py));
    UNIQ(px);
    UNIQ(py);
    map<int, int> mx, my;
    for (int i = 0; i < px.size(); i++) mx[px[i]] = i;
    for (int i = 0; i < py.size(); i++) my[py[i]] = i;

    for (int i = 0; i < n; i++) {
        board[my[y[i]]][mx[x[i]]] = p[i];
        num[my[y[i]]][mx[x[i]]] = 1;
    }

    for (int i = 0; i < n; i++) {
        for (int j = 1; j <= n; j++) {
            sum[i][j] = sum[i][j-1] + board[i][j-1];
            nsum[i][j] = nsum[i][j-1] + num[i][j-1];
        }
    }

    int res = 0;
    for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j++) {
            res = max(res, calc(i, j));
        }
    }
    return res;
}

void input() {
    cin >> n >> b;
    for (int i = 0; i < n; i++) cin >> x[i] >> y[i] >> p[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}