#include <iostream>

#include <vector>

#include <algorithm>

#include <string>

#include <cstring>

using namespace std;

struct  Fruit{

    int height;

    int mass;

    Fruit(int height_ =  , int mass_ = ):height(height_),mass(mass_){}

    bool operator <(const Fruit& a) const {

        if(height != a.height) return height < a.height;

        else return mass < a.mass;

    }

};

int main(){

    int n,x;

    cin >> n>>x;

    vector<Fruit>  fruit[];

    for(int i =  ; i < n; ++ i){

        int t,h,m;

        cin >> t >> h >> m;

        fruit[t].push_back(Fruit(h,m));

    }

    sort(fruit[].begin(),fruit[].end());

    sort(fruit[].begin(),fruit[].end());

    int  ans = ;

    for(int type =  ; type < ; ++ type ){

        vector<vector<bool> > visit();

        for(int i =  ; i < fruit[].size(); ++ i) visit[].push_back(false);

        for(int i =  ; i < fruit[].size(); ++ i) visit[].push_back(false);

        int res = ,new_x = x;

        bool flag = true;

        while(flag){

            for(int k = ; k < ; ++ k){

                int new_type = (type+k)%, index = fruit[new_type].size()-;
　　　　　　　　　　//搜索高度小于new_x的最大高度

                for(;index>=; --index){

                    if(!visit[new_type][index] && fruit[new_type][index].height <= new_x) break;

                }

                if(index <  ) {flag = false;break;}
　　　　　　　　　　//在满足条件的高度中搜索质量最大的

                int maxMassIndex = index,maxMass =  fruit[new_type][index].mass;

                for(int i = index -; i >=; -- i){

                    if(!visit[new_type][i] && fruit[new_type][i].mass > maxMass){

                        maxMass = fruit[new_type][i].mass ;

                        maxMassIndex = i;

                    }

                }

                index = maxMassIndex;

                visit[new_type][index] = true;        //标识该糖果已被访问

                new_x +=fruit[new_type][index].mass;  //更新x

                res ++;

            }

        }

        ans = max(ans,res);

    }

    cout<<ans<<endl;

}