d.cpp

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n, m;
    cin >> n >> m;
    int a[m][n];
    int b[n+1]={};
    int k, l=0;
    int maxi = -1;
    memset(b,0,sizeof(b));
    for (int i = 1; i <= m; i++){
        int max = -1;
        int pos = 0;
        for (int j = 1; j <= n; j++){
            cin >> a[i][j];
            if(max<a[i][j])max = a[i][j],pos = j;
        }
        b[pos]++;
        if(b[pos]>maxi){
            maxi = b[pos],l=pos;
        }
        else if(b[pos]==maxi){
            l = min(pos,l);
        }
    }
    cout << l << endl;
}