#include<bits/stdc++.h> using namespace std; int n,k,a; struct volunteer{ int point; int number; }ans[101]; int cmp(volunteer x,volunteer y){ return x.point>y.point; } int main(){ cin>>n>>k; for(int i=1;i<=k;i++){ for(int j=1;j<=n;j++){ cin>>a; ans[j].point+=a; if(i==1) ans[j].number=j; } } sort(ans+1,ans+n+1,cmp); for(int i=1;i<=n;i++){ if(ans[i].point!=ans[i-1].point&&i!=1) break; cout<<ans[i].number<<endl; } return 0; }