Problem Statement

There are $X+Y+Z$ people, conveniently numbered $1$ through $X+Y+Z$. Person $i$ has $A_i$ gold coins, $B_i$ silver coins and $C_i$ bronze coins.

Snuke is thinking of getting gold coins from $X$ of those people, silver coins from $Y$ of the people and bronze coins from $Z$ of the people. It is not possible to get two or more different colors of coins from a single person. On the other hand, a person will give all of his/her coins of the color specified by Snuke.

Snuke would like to maximize the total number of coins of all colors he gets. Find the maximum possible number of coins.

Constraints

• $1 \leq X$
• $1 \leq Y$
• $1 \leq Z$
• $X+Y+Z \leq 10^5$
• $1 \leq A_i \leq 10^9$
• $1 \leq B_i \leq 10^9$
• $1 \leq C_i \leq 10^9$

Input

Input is given from Standard Input in the following format:

X Y Z
A_1 B_1 C_1
A_2 B_2 C_2
:
A_{X+Y+Z} B_{X+Y+Z} C_{X+Y+Z}

Output

Print the maximum possible total number of coins of all colors he gets.