cf Elections【简单矩阵处理】

Elections

Time Limit: 1000MS

Memory Limit: 262144KB

64bit IO Format: %I64d & %I64u

 

Description

The 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⁹) 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⁹.

Output

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

Sample Input

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

Hint

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.

题意：

给出n行m列，对应的数据代表第n个城市对第m的选手的票数，选举分为两次，第一次，每个城市选出这个城市得票最高的选手成为胜利者，如果票数一样，选编号最小的，然后第二轮，选择这些人里面在各个城市被选的胜利次数最多的选手作为最终胜利者，如果次数一样，选编号最小的。

题解：

遍历矩阵的行和列，统计其中最值出现的位置，然后遍历查找最大值的选手，就是所需的值了....

#include<stdio.h>
#include<string.h>
#define max(a,b) (a>b?a:b)
int x[105][105],cnt[105],n,m;
void solve()
{
	memset(cnt,0,sizeof(cnt));
	int i,j,k;
	for(i=1;i<=n;++i)
	{
		k=1;
		for(j=1;j<=m;++j)
		{
			if(x[i][j]>x[i][k])//统计每一行最先出现最大值的位置
			{
				k=j;
			}
		}
		++cnt[k];//标记一次胜利
	}
	k=1;
	for(i=1;i<105;++i)//查找最先出现的胜利次数最多的人
	{
		if(cnt[i]>cnt[k])
		{
			k=i;
		}
	}
	printf("%d\n",k);
}
int main()
{
	int i,j;
	//freopen("shuju.txt","r",stdin);
	while(~scanf("%d%d",&m,&n))// 坑死人的n和m！！！
	{
		for(i=1;i<=n;++i)
		{
			for(j=1;j<=m;++j)
			{
				scanf("%d",&x[i][j]);
			}
		}
		solve();
	}
	return 0;
}