#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
#include <climits>
#include <numeric>
#include <functional>
#include <time.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)a; i <= (int)b; i++)
template<class T> void checkmin(T &a, T b) { if (b < a) a = b; }
template<class T> void checkmax(T &a, T b) { if (b > a) a = b; }

const int MaxN = 800, MaxM = 3;
int N, M;
int Table[MaxM][MaxN];
int bestVal[MaxN + 1][MaxN + 1];

void solve() {
    double maxEx = -1;
    int bestIndex = 0;

    for (int i = 0; i < M; i++) {

        rep(a, N + 1) rep(b, N + 1) bestVal[a][b] = 0;
        int ex = 0;

        rep(a, N) FOR(b, a + 1, N - 1) {
            if (Table[i][a] < Table[i][b]) {
                FOR(c, b + 1, N - 1) if (Table[i][b] > Table[i][c]) {
                    checkmax(bestVal[Table[i][a]][Table[i][b]], Table[i][b]);
                    checkmax(bestVal[Table[i][c]][Table[i][b]], Table[i][b]);
                    if (Table[i][a] < Table[i][c])
                        checkmax(bestVal[Table[i][a]][Table[i][c]], Table[i][b]);
                    else
                        checkmax(bestVal[Table[i][c]][Table[i][a]], Table[i][b]);
                }
            } else {
                FOR(c, b + 1, N - 1) if (Table[i][b] < Table[i][c]) {
                    int val = max(Table[i][a], Table[i][c]);
                    checkmax(bestVal[Table[i][b]][Table[i][a]], val);
                    checkmax(bestVal[Table[i][b]][Table[i][c]], val);
                    if (Table[i][a] < Table[i][c])
                        checkmax(bestVal[Table[i][a]][Table[i][c]], val);
                    else
                        checkmax(bestVal[Table[i][a]][Table[i][a]], val);
                }
            }
        }
        FOR(a, 1, N) FOR(b, a + 1, N) ex += bestVal[a][b];
        if (ex > maxEx) {
            maxEx = ex;
            bestIndex = i;
        }
    }

    cout << bestIndex << endl;
}

int main() {
    cin >> N >> M;
    rep(i, M) rep(x, N) {
        cin >> Table[i][x];
    }
    solve();
    return 0;
}