A12869 | Sum Balance

Ujan has a lot of numbers in his boxes. He likes order and balance, so he decided to reorder the numbers.

There are $k$ boxes numbered from $1$ to $k$ . The $i$ -th box contains $n_i$ integer numbers. The integers can be negative. All of the integers are distinct.

Ujan is lazy, so he will do the following reordering of the numbers exactly once. He will pick a single integer from each of the boxes, $k$ integers in total. Then he will insert the chosen numbers — one integer in each of the boxes, so that the number of integers in each box is the same as in the beginning. Note that he may also insert an integer he picked from a box back into the same box.

Ujan will be happy if the sum of the integers in each box is the same. Can he achieve this and make the boxes perfectly balanced, like all things should be?

The first line contains a single integer $k$ ( $1 \leq k \leq 15$ ), the number of boxes.

The $i$ -th of the next $k$ lines first contains a single integer $n_i$ ( $1 \leq n_i \leq 5\,000$ ), the number of integers in box $i$ . Then the same line contains $n_i$ integers $a_{i,1}, \ldots, a_{i,n_i}$ ( $|a_{i,j}| \leq 10^9$ ), the integers in the $i$ -th box.

It is guaranteed that all $a_{i,j}$ are distinct.

If Ujan cannot achieve his goal, output "No" in a single line. Otherwise in the first line output "Yes", and then output $k$ lines. The $i$ -th of these lines should contain two integers $c_i$ and $p_i$ . This means that Ujan should pick the integer $c_i$ from the $i$ -th box and place it in the $p_i$ -th box afterwards.

If there are multiple solutions, output any of those.

You can print each letter in any case (upper or lower).