There are $N$ jewelry shops. Each jewelry shop has three types of coins, gold, platinum, and diamond. The worth of gold, platinum, and diamonds coins is $A$, $B$, and $C$ respectively. You decided to go to each of $N$ jewelry shops and take coins from each of the shops by satisfying the following conditions:

1.  You can take at most $1$ coin from an individual shop.
2.  You can take at most $X$ gold coins.
3.  You can take at most $Y$ platinum coins. 
4.  You can take at most $Z$ diamond coins.

You are required to collect coins from shops in such a way that the worth value of coins that are collected is maximized.

Input format

• First line: An integer $N$ denoting the number of jewelry shops
• Second line: Three integers $X$, $Y$, and $Z$ denoting the maximum number of gold, platinum, and diamond coins respectively
• Next $N$ lines: Three space-separated integers $A$, $B$, and $C$ denoting the worth value of the gold, platinum, and diamond coins respectively

Output format

Print a single integer representing the maximum worth value that you can get.

Constraints

$1 \le N \le 200$

$1 \le X, Y, Z \le N$

$1 \le A, B, C \le 10^9$