Codeforces Round #316 (Div. 2) A

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 aij (1 ≤ j ≤ n, 1 ≤ i ≤ m, 0 ≤ aij ≤ 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.

Sample test(s)

input

output

input

output

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.

看上面的解释也应该知道怎么做了吧

#include<stdio.h>
//#include<bits/stdc++.h>
#include<string.h>
#include<iostream>
#include<math.h>
#include<sstream>
#include<set>
#include<queue>
#include<map>
#include<vector>
#include<algorithm>
#include<limits.h>
#define inf 0x7fffffff
#define INFL 0x7fffffffffffffff
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
#define ULL unsigned long long
using namespace std;
int q[1000];
struct P
{
    int num;
    int adress;
}L[100000];
bool cmd(P x,P y)
{
    if(x.num==y.num)
    {
        return x.adress<y.adress;
    }
    else
    return x.num>y.num;
}
int main()
{
    int n,m;
    int ans;
    int sum=-inf;
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        for(int j=1;j<=n;j++)
        {
            cin>>L[j].num;
            L[j].adress=j;
        }
        sort(L+1,L+n+1,cmd);
       // cout<<L[1].adress;
       q[L[1].adress]++;
    }
  //  sort(q+1,q+1+n);
    for(int i=1;i<=n;i++)
    {
        sum=max(q[i],sum);
        //cout<<q[i]<<endl;
    }
    for(int i=1;i<=n;i++)
    {
        if(q[i]==sum)
        {
            cout<<i<<endl;
            break;
        }
        //sum=max(q[i],sum);
        //cout<<q[i]<<endl;
    }
  //  cout<<sum<<endl;
  //   cout<<q[n]<<endl;
    return 0;
}