Back From Summer '19 P1: Winnie's Orphans

View as PDF

Submit solution

Points: 3
Time limit: 2.0s
Memory limit: 64M

Problem type

Winnie is feeling generous today, so she decided to adopt all the children in an orphanage. There are N orphanages, numbered from 1 to N, that she can choose from. Each orphanage has M children. Each child has a cuteness value of a_i ranging from 1 to 10. Winnie cannot handle children that are too cute, or children that are too ugly. Because of this, Winnie wants to choose the orphanage that has the least number of children with a cuteness value of 1 or 10. Can you help Winnie find this orphanage?

Input Specification

The first line of input will contain two integers N, M (1 \le N, M \le 1000), the number of orphanages and the number of children in each orphanage.

The next N lines will each contain M integers, representing the cuteness values of each child. Line i will represent the children from orphanage i. The cuteness values are between 1 and 10, inclusive.

Output Specification

Output the index of the orphanage with the least number of children with a cuteness value of 1 or 10. If multiple orphanages exist, output the one with the smallest index.

Sample Input

3 3
2 1 8
4 10 9
3 6 4

Sample Output


Explanation For Sample

The third orphanage has no children with a cuteness value of 1 or 10, while the first and second orphanages both have one child.


There are no comments at the moment.