#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }

/*
 <url:https://yukicoder.me/problems/no/165>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */
ll solve(){
    ll res = 0;
    ll N,B; cin >> N >> B;
    vector<ll> X(N),Y(N),P(N);
    for(int i = 0; i < N;i++){
        cin >> X[i] >> Y[i] >> P[i];
    }
    for(int i = 0; i < N;i++){
        for(int j = i; j < N;j++){
            for(int k = j; k < N;k++){
                ll x1,x2,y1,y2;
                x1 = min({X[i],X[j],X[k]}); x2 = max({X[i],X[j],X[k]});
                y1 = min({Y[i],Y[j],Y[k]}); y2 = max({Y[i],Y[j],Y[k]});
                
                ll sumP = 0;
                ll cnt = 0;
                for(int l = 0; l < N;l++){
                    if(sumP > B) break;
                    if(x1 <= X[l] && X[l] <= x2 && y1 <= Y[l] && Y[l] <= y2){
                        sumP += P[l];
                        cnt++;
                    }
                }
                if(sumP <= B){
                    res = max(res,cnt);
                }
            }
        }
    }
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    cout << solve() << endl;
    return 0;
}