#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    vector<pair<int,int>> b(m);
    auto f = [&](int l, int r){
        int mx = 0, coef = max(a[l], a[r]);
        for(int i = 0; i < l; i++){
            if(a[i] > a[l] && a[l] < a[r]) mx = max(mx, max(a[i], coef));
            if(a[i] < a[l] && a[l] > a[r]) mx = max(mx, max(a[i], coef));
        }
        for(int i = l + 1; i < r; i++){
            if(a[l] > a[i] && a[i] < a[r]) mx = max(mx, max(a[i], coef));
            if(a[l] < a[i] && a[i] > a[r]) mx = max(mx, max(a[i], coef));
        }
        for(int i = r + 1; i < n; i++){
            if(a[l] > a[r] && a[r] < a[i]) mx = max(mx, max(a[i], coef));
            if(a[l] < a[r] && a[r] > a[i]) mx = max(mx, max(a[i], coef));
        }
        return mx;
    };
    for(int i = 0; i < m; i++){
        for(auto &&v: a) cin >> v;
        b[i] = {0, -i};
        for(int j = 0; j < n; j++){
            for(int k = j + 1; k < n; k++){
                b[i].first += f(j, k);
            }
        }
    }
    sort(b.rbegin(), b.rend());
    cout << -b[0].second << '\n';
}