A

                                                                                  A - Elections

 

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

SubmitStatusPracticeCodeForces 570A

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

这一题,容我再去看一遍题意..
好了，言归正传：
老规矩，先上题意：就是国家选举，这个国家有着奇葩的选举制度，共有n个候选人和m个城市，每个候选人在每个城市获得的选票列成一行，所以共有n行。所有城市获得的选票相加和最大的候选人获胜，那么，当有两个以上候选人所得选票都是最大值怎么办呢，奇葩就奇葩在这里！当这种情况发生的时候，他们就会选输入顺序最靠前的候选人当选总统。。
好了，下面是AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int MAX=150;
const int INF=1<<30;//表示正无穷 
int n,m;
int main(){
    while(scanf("%d %d",&m,&n)!=EOF){
        int a[MAX][MAX];
        int b[MAX];//储存所有候选人的选票和 
        int k;
        memset(b,0,sizeof(b));
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                scanf("%d",&a[i][j]);
            }
        }
        for(int i=1;i<=n;i++){
            k=1;
            for(int j=1;j<=m;j++)
        {
            if(a[i][j]>a[i][k])
            {
                k=j;
            }
            
        }
        ++b[k];
        }
        k=1;
        for(int i=1;i<MAX;i++)
    {
        if(b[i]>b[k])//找出最靠前的最大值 
        {
            k=i;
        }
    }
    printf("%d
",k);
}
    
    return 0;
}