#include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <climits>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
using namespace std;
typedef pair<int ,int > P;
typedef long long ll;

bool isKado(int a,int b,int c) {
    if(a==b) return false;
    if(b==c) return false;
    if(c==a) return false;
    vector<int> vec;
    vec.pb(a);
    vec.pb(b);
    vec.pb(c);
    sort(all(vec));
    return vec[1]==a||vec[1]==c;
}
string to_s(P p) {
    stringstream ss;
    ss << "(";
    ss << p.fr;
    ss << ", ";
    ss << p.sc;
    ss << ")";
    return ss.str();
}
bool isKado(vector<int> vec,int i,int j,int k) {
    vector<P> v;
    v.push_back(P(i,vec[i]));
    v.push_back(P(j,vec[j]));
    v.push_back(P(k,vec[k]));
    sort(all(v));
    //cout<<__LINE__<<": "<<to_s(v[0])<<", "<<to_s(v[1])<<", "<<to_s(v[2])<<endl;
    return isKado(v[0].sc,v[1].sc,v[2].sc);
}

double func(vector<int> E) {
    int sum=0;
    int cnt=0;
    rep(i,E.size()) rep(j,E.size()) if(i<j) {
        int t=0;
        rep(k,E.size()) if(i!=k&&j!=k) {
            //cout<<__LINE__<<": "<<E[i]<<", "<<E[j]<<", "<<E[k]<<endl;
            if(!isKado(E,i,j,k)) continue;

            t=max(t,max({E[i],E[j],E[k]}));
        }
        //cout<<E[i]<<", "<<E[j]<<": "<<t<<endl;
        cnt++;
        sum+=t;
    }
    //cout<<sum<<", "<<cnt<<endl;

    return 1.0*sum/cnt;
}
int N,M;
vector<int> E[802];
int main() {
    cin>>N>>M;
    double maxi=0;
    int ans=0;
    rep(i,M) rep(j,N) {
        int t;
        cin>>t;
        E[i].push_back(t);
    }
    rep(i,M) {
        double t=func(E[i]);
        //cout<<i<<": "<<t<<endl;
        if(maxi<t) {
            maxi=t;
            ans=i;
        }
    }
    cout<<ans<<endl;

    return 0;
}