http://bailian.openjudge.cn/practice/2442
总时间限制:
6000ms
内存限制:
65536kB
描述
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 n ^ m this kind of sequences. Then we can calculate the sum of numbers in each sequence, and get n ^ m 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 (0 < m <= 100, 0 < n <= 2000). 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.
样例输入
1
2 3
1 2 3
2 2 3
样例输出
3 3 4
来源
POJ Monthly,Guang Lin