Codeforces Round 316 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

implementation

*1100

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Elections

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe country of Byalechinsk is running elections involving *n* candidates. The country consists of *m* cities. We know how many people in each city voted for each candidate.

The electoral system in the country is pretty unusual. At the first stage of elections the votes are counted for each city: it is assumed that in each city won the candidate who got the highest number of votes in this city, and if several candidates got the maximum number of votes, then the winner is the one with a smaller index.

At the second stage of elections the winner is determined by the same principle over the cities: the winner of the elections is the candidate who won in the maximum number of cities, and among those who got the maximum number of cities the winner is the one with a smaller index.

Determine who will win the elections.

Input

The first line of the input contains two integers *n*, *m* (1 ≤ *n*, *m* ≤ 100) — the number of candidates and of cities, respectively.

Each of the next *m* lines contains *n* non-negative integers, the *j*-th number in the *i*-th line *a*_{ij} (1 ≤ *j* ≤ *n*, 1 ≤ *i* ≤ *m*, 0 ≤ *a*_{ij} ≤ 10^{9}) denotes the number of votes for candidate *j* in city *i*.

It is guaranteed that the total number of people in all the cities does not exceed 10^{9}.

Output

Print a single number — the index of the candidate who won the elections. The candidates are indexed starting from one.

Examples

Input

3 3

1 2 3

2 3 1

1 2 1

Output

2

Input

3 4

10 10 3

5 1 6

2 2 2

1 5 7

Output

1

Note

Note to the first sample test. At the first stage city 1 chosen candidate 3, city 2 chosen candidate 2, city 3 chosen candidate 2. The winner is candidate 2, he gained 2 votes.

Note to the second sample test. At the first stage in city 1 candidates 1 and 2 got the same maximum number of votes, but candidate 1 has a smaller index, so the city chose candidate 1. City 2 chosen candidate 3. City 3 chosen candidate 1, due to the fact that everyone has the same number of votes, and 1 has the smallest index. City 4 chosen the candidate 3. On the second stage the same number of cities chose candidates 1 and 3. The winner is candidate 1, the one with the smaller index.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/08/2023 21:26:29 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|