4651: Sequence
内存限制：64 MB
时间限制：6 S
标准输入输出
题目类型：传统
评测方式：文本比较
上传者：
提交：1
通过：1
题目描述
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?
输入格式
输出格式
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