Migrated from Lutece 1802 The Night of Xiaomai

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

The brother is on business, so Xiaomai will have a fantastic night, which makes her do anything she wants. There are n game(s) of kinds to be played. In every game, she can get $a_i$ points on happiness, but it takes $b_i$ points on time and $c_i$ points to have the room dirty. If the brother comes at the time of $x$, she is still playing the game or the points are over y on the room dirty. As a result, she will be punished. Therefore, the cute Xiaomai hope that you can help her make a perfect plan, which can get the most happiness points without the brother’s punishment.

Input

The first line contains three integers $n$,$X$ and $Y$ ($n=5$, $0\leq X ,Y\leq 10^8$).
Each of the following $n$ lines contains three integers $a_i$, $b_i$ and $c_i$ ($0\leq a_i,b_i,c_i\leq 10^8$).

Output

In the first line print a single integer $m$ denoting the happy points Xiaomai gets.

Samples

5 5 5
10 6 0
2 4 4
3 4 4
0 0 0
0 0 0

3