#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,(int)(n)-1,0)
#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP(i,0,(int)(n)-1)
#define INF 100000000

typedef long long ll;

int prize(int a, int b, int c) {
    if (a != c && (b < min(a,c) || b > max(a,c)))
        return max({a,b,c});
    else
        return 0;
}

int main() {
    int i, j, k, l, n, m, ans, mx;
    int e[3][800];
    cin >> n >> m;
    rep (i,m) rep (j,n) cin >> e[i][j];
    mx = ans = 0;
    rep (i,m) {
        double sum = 0, cnt = 0;
        rep (j,n) REP (k,j+1,n-1) {
            int p = 0;
            rep (l,n) {
                if (l < j)
                    p = max(p,prize(e[i][l],e[i][j],e[i][k]));
                else if (l < k)
                    p = max(p,prize(e[i][j],e[i][l],e[i][k]));
                else 
                    p = max(p,prize(e[i][j],e[i][k],e[i][l]));
            }
            sum += p;
            cnt++;
        }
        sum /= cnt;
        if (mx < sum) {
            mx = sum;
            ans = i;
        }
    }
    cout << ans << endl;
    return 0;
}