Return of the Poop Game

Gunho saw too many poop game ads on YouTube, so he decided to install one and play it himself.

Gunho starts with combat power $D$. There are $N$ rooms in front of him. Each room holds either a monster or equipment. The monster or equipment in the $i$-th room ($1\leq i\leq N$) has combat power $X_i$.

Each time, Gunho can freely choose which room to enter next among the rooms he has not yet cleared. He acts as follows depending on what the room contains.

• Monster: If Gunho's combat power is greater than the monster's, he can defeat the monster, and then the monster's combat power is added to his. If his combat power is less than or equal to the monster's, he loses.
• Equipment: He can obtain it regardless of his current combat power, and his combat power is multiplied by the equipment's combat power. However, he can obtain a piece of equipment only after obtaining every piece of equipment with lower combat power than it.

When he defeats a monster or obtains equipment, that room is cleared. The game ends when Gunho clears every room or loses to a monster.

Assuming Gunho plays with the best strategy, find the maximum number of rooms he can clear.

Note that there is no upper limit on the combat power Gunho can reach through his actions.

The first line contains the number of rooms $N$ and Gunho's starting combat power $D$, separated by a space ($1\leq N\leq 100000$, $1\leq D\leq 10^9$).

Each of the next $N$ lines contains $A_i$ and $X_i$, separated by a space, describing one room. $A_i$ is 1 if the room has a monster and 2 if it has equipment. $X_i$ ($2\leq X_i\leq 10^9$) is the combat power of the monster or equipment in that room.

On the first line, print the maximum number of rooms Gunho can clear.

Gunho still has not cleared this poop game...