Hozirda online


Masalalar soni: 909

Foydalanuvchilar soni: 8819

Jo'natishlar soni: 714352

Muhokama yozuvlari: 4541

Yangiliklar soni: 97

Yangiliklar izohlari: 1174

So'ngi izohlar

783. Very Simple Problem
Vaqt limiti: 1 sekund
Xotira limiti: 64 MB

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 simple 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 complexity rating (not necessarily different for different problems). The jury member calls simplest those problems that he gave the minimum complexity rating, and hardest 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 very simple, if it was called as simplest by more than a half of the jury, and was called as hardest by nobody.


The first line of input file contains integers N and P (1 £ N, P £ 100), 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 must contain an ordered list of very simple problem numbers, separated by spaces. If there are no such problems, output must contain a single integer 0 (zero).





4 4

1 1 1 2

5 900 21 40

10 10 9 10

3 4 3 5



Tayyorladi: Azat Yusupov
Text from: e-olimp.com
Mening urinishlarim(0) Muhokama (0) Jo'natish Eng yaxshi yechimlar Barcha muvaffaqiyatli urinishlar(46) Barcha urinishlar(118)