
ZOJ Problem Set  2511
Soon after he decided to design a Tshirt for our Algorithm Board on FreeCity BBS, XKA found that he was trapped by all kinds of suggestions from everyone on the board. It is indeed a missionimpossible to have everybody perfectly satisfied. So he took a poll to collect people's opinions. Here are what he obtained: N people voted for M design elements (such as the ACMICPC logo, big names in computer science, wellknown graphs, etc.). Everyone assigned each element a number of satisfaction. However, XKA can only put K (<=M) elements into his design. He needs you to pick for him the K elements such that the total number of satisfaction is maximized. InputThe input consists of multiple test cases. For each case, the first line contains three positive integers N, M and K where N is the number of people, M is the number of design elements, and K is the number of elements XKA will put into his design. Then N lines follow, each contains M numbers. The jth number in the ith line represents the ith person's satisfaction on the jth element. OutputFor each test case, print in one line the indices of the K elements you would suggest XKA to take into consideration so that the total number of satisfaction is maximized. If there are more than one solutions, you must output the one with minimal indices. The indices start from 1 and must be printed in nonincreasing order. There must be exactly one space between two adjacent indices, and no extra space at the end of the line. Sample Input:3 6 4 2 2.5 5 1 3 4 5 1 3.5 2 2 2 1 1 1 1 1 10 3 3 2 1 2 3 2 3 1 3 1 2Sample Output: 6 5 3 1 2 1 Author: CHEN, Yue Source: CYJJ's Funny Contest #1, Killing in Seconds 