## Problem M. Very Simple Problem ≡

• problems
 Author: Far-Eastern Subregional Time limit: 1 sec Input file: input.txt Memory limit: 8 Mb Output file: output.txt

### Statement

During a preparation of programming contest, its jury is usually faced with many difficult tasks. One of them is to select a problem simple enough to most, if not all, contestants to solve.

The difficulty here lies in diverse meanings of the term &quot;simple&quot; amongst the jury members. So, the jury uses the following procedure to reach a consensus: each member weights each proposed problem with a positive integer &quot;complexity rating&quot; (not necessarily different for different problems). The jury member calls &quot;simplest&quot; those problems that he gave the minimum complexity rating, and &quot;hardest&quot; those problems that he gave the maximum complexity rating.

The ratings received from all jury members are then compared, and a problem is declared as &quot;very simple&quot;, if it was called as &quot;simplest&quot; by more than a half of the jury, and was called as &quot;hardest&quot; by nobody.

### Input file format

The first line of input file contains integers N and P, the number of jury members and the number of problems. The following N lines contain P integers in range from 0 to 1000 each - the complexity ratings.

### Output file format

Output file must contain an ordered list of &quot;very simple&quot; problem numbers, separated by spaces. If there are no such problems, output must contain a single integer 0 (zero).

### Constraints

1 &le; N, P &le; 100

### Sample tests

No. Input file (input.txt) Output file (output.txt)
1
4 4
1 1 1 2
5 900 21 40
10 10 9 10
3 4 3 5

3

0.054s 0.013s 13