#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

template<class T> void sort(int N, T a[], void *mem = NULL){sort(a,a+N);}
template<class T1, class T2> void sort(int N, T1 a[], T2 b[], void *mem){int i;pair<T1,T2> *r=(pair<T1, T2>*)mem;rep(i,N)r[i].first=a[i],r[i].second=b[i];sort(r,r+N);rep(i,N)a[i]=r[i].first,b[i]=r[i].second;}
template<class T1, class T2, class T3> void sort(int N, T1 a[], T2 b[], T3 c[], void *mem){int i;pair<T1,pair<T2,T3> > *r=(pair<T1,pair<T2,T3> >*)mem;rep(i,N)r[i].first=a[i],r[i].second.first=b[i],r[i].second.second=c[i];sort(r,r+N);rep(i,N)a[i]=r[i].first,b[i]=r[i].second.first,c[i]=r[i].second.second;}
template<class T1, class T2, class T3, class T4> void sort(int N, T1 a[], T2 b[], T3 c[], T4 d[], void *mem){int i;pair<pair<T1,T2>,pair<T3,T4> > *r=(pair<pair<T1,T2>,pair<T3,T4> >*)mem;rep(i,N)r[i].first.first=a[i],r[i].first.second=b[i],r[i].second.first=c[i],r[i].second.second=d[i];sort(r,r+N);rep(i,N)a[i]=r[i].first.first,b[i]=r[i].first.second,c[i]=r[i].second.first,d[i]=r[i].second.second;}

template<class T, class S>
void unique(T arr[], S val[], int &sz, void *mem, int sorted=0){
  int i, k = 0;
  if(!sorted) sort(sz, arr, val, mem);
  rep(i,sz){
    if(!k || arr[k-1]!=arr[i]){
      arr[k] = arr[i];
      val[k] = val[i];
      k++;
    } else {
      val[k-1] += val[i];
    }
  }
  sz=k;
}

template<class T, class S, class V>
void unique(T arr[], S v1[], V v2[], int &sz, void *mem, int sorted=0){
  int i, k = 0;
  if(!sorted) sort(sz, arr, v1, v2, mem);
  rep(i,sz){
    if(!k || arr[k-1]!=arr[i]){
      arr[k] = arr[i];
      v1[k] = v1[i];
      v2[k] = v2[i];
      k++;
    } else {
      v1[k-1] += v1[i];
      v2[k-1] += v2[i];
    }
  }
  sz = k;
}


char memarr[17000000]; void *mem = memarr;
#define MD 1000000007

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

int M;
int y[1000], p[1000], sz[1000];

int main(){
  int i, j, k, sum;
  int x1, x2;
  int res = 0;
  int tmp, poi;

  reader(&N,&B);
  rep(i,N) reader(X+i,Y+i,P+i);

  sort(N, X, Y, P, mem);

  rep(x1,N) REP(x2,x1,N){
    if(res >= x2-x1+1) continue;
    if(x1 && X[x1-1]==X[x1]) continue;
    if(x2+1<N && X[x2]==X[x2+1]) continue;

    M = 0;
    sum = 0;
    REP(i,x1,x2+1){
      y[M] = Y[i];
      p[M] = P[i];
      sz[M] = 1;
      sum += P[i];
      M++;
    }
    if(sum <= B){ res = max(res, M); continue; }
    unique(y, p, sz, M, mem);

    tmp = 0;
    poi = 0;
    j = 0;
    rep(i,M){
      while(j < M && poi+p[j] <= B) poi+=p[j], tmp+=sz[j], j++;
      res = max(res, tmp);
      poi -= p[i];
      tmp -= sz[i];
    }
  }

  writerLn(res);

  return 0;
}