A9539 | Feed with Candy

The hero of the Cut the Rope game is a little monster named Om Nom. He loves candies. And what a coincidence! He also is the hero of today's problem.

One day, Om Nom visited his friend Evan. Evan has $n$ candies of two types (fruit drops and caramel drops), the $i$ -th candy hangs at the height of $h_{i}$ centimeters above the floor of the house, its mass is $m_{i}$ . Om Nom wants to eat as many candies as possible. At the beginning Om Nom can make at most $x$ centimeter high jumps. When Om Nom eats a candy of mass $y$ , he gets stronger and the height of his jump increases by $y$ centimeters.

What maximum number of candies can Om Nom eat if he never eats two candies of the same type in a row (Om Nom finds it too boring)?

The first line contains two integers, $n$ and $x$ $(1<=n,x<=2000)$ — the number of sweets Evan has and the initial height of Om Nom's jump.

Each of the following $n$ lines contains three integers $t_{i},h_{i},m_{i}$ $(0<=t_{i}<=1; 1<=h_{i},m_{i}<=2000)$ — the type, height and the mass of the $i$ -th candy. If number $t_{i}$ equals 0, then the current candy is a caramel drop, otherwise it is a fruit drop.

Print a single integer — the maximum number of candies Om Nom can eat.