Very Simple Problem#2651
During the preparation for a programming contest, the jury often faces many difficult tasks. One of them is to select a problem that is simple enough for most, if not all, contestants to solve.
The difficulty lies in the fact that jury members may have different interpretations of what constitutes a "simple" problem. Therefore, the jury uses the following procedure to reach a consensus: each member assigns a positive integer "complexity rating" to each proposed problem (different problems may share the same rating for a member). A jury member considers those problems to be "simplest" to which they gave the minimum complexity rating, and calls "hardest" those to which they gave the maximum complexity rating.
The ratings from all jury members are then compared, and a problem is declared "very simple" if it was called "simplest" by more than half of the jury members and was not called "hardest" by any member.
The first line of the input file contains integers and (1 \leq N, P \leq 100), the number of jury members and the number of problems. Each of the following lines contains integers in the range from to — the complexity ratings.
The output file must contain an ordered list of the numbers of all "very simple" problems, separated by spaces. If there are no such problems, the output must contain a single integer 0 (zero).
Example 1