Given m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear that we may get

this kind of sequences. Then we can calculate the sum of numbers in each sequence, and get

values. What we need is the smallest n sums. Could you help us?
输入描述:
The first line is an integer T, which shows the number of test cases, and then T test cases follow. The first line of each case contains two integers m, n
. The following m lines indicate the m sequence respectively. No integer in the sequence is greater than 10000.
输出描述:
For each test case, print a line with the smallest n sums in increasing order, which is separated by a space.