To get money for a new aeonic blaster, ranger Qwerty decided to engage in trade for a while. He wants to buy some number of items (or probably not to buy anything at all) on one of the planets, and then sell the bought items on another planet. Note that this operation is not repeated, that is, the buying and the selling are made only once. To carry out his plan, Qwerty is going to take a bank loan that covers all expenses and to return the loaned money at the end of the operation (the money is returned without the interest). At the same time, Querty wants to get as much profit as possible. The system has n planets in total. On each of them Qwerty can buy or sell items of m types (such as food, medicine, weapons, alcohol, and so on). For each planet i and each type of items j Qwerty knows the following: a ij — the cost of buying an item; b ij — the cost of selling an item; c ij — the number of remaining items. It is not allowed to buy more than c ij items of type j on planet i , but it is allowed to sell any number of items of any kind. Knowing that the hold of Qwerty's ship has room for no more than k items, determine the maximum profit which Qwerty can get. The first line contains three space-separated integers n , m and k ( 2 ≤ n ≤ 10 , 1 ≤ m , k ≤ 100 ) — the number of planets, the number of question types and the capacity of Qwerty's ship hold, correspondingly. Then follow n blocks describing each planet. The first line of the i -th block has the planet's name as a string with length from 1 to 10 Latin letters. The first letter of the name is uppercase, the rest are lowercase. Then in the i -th block follow m lines, the j -th of them contains three integers a ij , b ij and c ij ( 1 ≤ b ij < a ij ≤ 1000 , 0 ≤ c ij ≤ 100 ) — the numbers that describe money operations with the j -th item on the i -th planet. The numbers in the lines are separated by spaces. It is guaranteed that the names of all planets are different. Print a single number — the maximum p