Elections

Description:

Input:

The first line of the input contains two integers $$$n$$$ and $$$m$$$ ($$$2\le n\le 100$$$; $$$1\le m \le 100$$$) — the number of candidates and the number of polling stations. The next $$$m$$$ lines contain the election results at each polling station with $$$n$$$ numbers on each line. In the $$$i$$$-th line the $$$j$$$-th number is $$$a_{i,j}$$$ — the number of votes cast for the candidate $$$j$$$ at the station $$$i$$$ ($$$0\le a_{i,j} \le 1\,000$$$).

Output:

In the first line output integer $$$k$$$ — the minimal number of the polling stations in which you need to cancel the election results. In the second line output $$$k$$$ integers — the indices of canceled polling stations, in any order. If there are multiple ways to cancel results at $$$k$$$ stations, output any one of them.

Sample Input:

5 3
6 3 4 2 8
3 7 5 6 7
5 2 4 7 9

Sample Output:

2
3 1 

Sample Input:

2 1
1 1

Sample Output:

0

Sample Input:

3 3
2 3 8
4 2 9
3 1 7

Sample Output:

3
1 2 3 

Note:

In the first example, the candidates from 1 to 5 received 14, 12, 13, 15, and 24 votes correspondingly. The opposition candidate has the most votes. However, if you cancel the election results at the first and the third polling stations, then only the result from the second polling station remains and the vote sums become 3, 7, 5, 6, and 7, without the opposition candidate being in the lead anymore.