Contest Score Integrity#9584
In a multi-round contest with participants, numbered from to , their scores from different locations are recorded. However, some scores might be invalid due to technical issues at certain locations, requiring results from such locations to be disqualified.
Participant is a special guest, and it is essential that this participant does not win by having a strictly greater total score than every other participant after any location disqualifications.
Your task is: Given the scores for all participants at each location, determine the minimal number of locations whose results must be disqualified so that participant does not have a strictly higher total score than any other participant.
Notice that a solution always exists: if results from all locations are disqualified, the scores for all participants will be and the special guest will not be the unique winner.
The first line contains two integers and (2 \le n \le 100, 1 \le m \le 100) — the number of participants and the number of locations. The next lines contain the contest scores at each location, with numbers per line. In the -th line, the -th number is a_{i,j} — the score of participant at location (0 \le a_{i,j} \le 1000).
In the first line, output an integer — the minimum number of locations whose results need to be disqualified. On the second line, output integers — the indices of the disqualified locations, in any order. If multiple solutions exist, output any one of them.
Beispiel 1
Beispiel 2
Beispiel 3