Računi - Državno

Djurica loves going to restaurants. Throughout the year he has went to a lot of them, and now he's really hungry and wondering which one to visit next. In all the restaurants Djurica visited, he ordered exactly k different meals, so one particular receipt he got can be described as id s₁ s₂ ... s_k.

The value id represents a unique identifier for one restaurant. A value of one meal can be 0 if the ith meal has not been ordered that time, and otherwise it is an integer representing the amount of money paid for the ith meal. Djurica has collected n receipts, and he is interested in the combined receipts for each restaurant. A combined receipt for a restaurant identified by id is defined as a receipt with k items where the value of the ith item represents the sum of all values for the ith item on all the receipts from the restaurant id.

When Djurica computes all the combined receipts, he considers the best place to go next the one where the combined bill is lexicographically smallest. Djurica is very hungry so he can't think clearly. He asked you to help him by making a program which will determine the lexicographically smallest combined receipt for a given list of receipts.

You should not consider the id value while determining the lexicographically smallest receipt. For two combined receipts a₁ a₂ ... a_k and b₁ b₂ ... b_k we say that the first receipt is lexicographically smaller than the second if there exists a number j such that a_i = b_i, i < j, and a_j < b_j.