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

#define all(c) ((c).begin()), ((c).end())
#define dump(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define REP(i, a, b) for (int i = a; i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define fst first
#define snd second
#define pb push_back
#define debug( fmt, ... ) \
        fprintf( stderr, \
                  fmt "\n", \
                  ##__VA_ARGS__ \
        )

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int INF = 1 << 29;
const double EPS = 1e-10;

double zero(double d) {
    return d < EPS ? 0.0 : d;
}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
    return os << '(' << p.first << ',' << p.second << ')';
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a) {
    os << '[';
    rep(i, a.size()) os << (i ? " " : "") << a[i];
    return os << ']';
}

string toString(int i) {
    stringstream ss;
    ss << i;
    return ss.str();
}

const int MOD = 1000000007;
// a^k
ll fpow(ll a, ll k, int M) {
    ll res = 1ll;
    ll x = a;
    while (k != 0) {
        if ((k & 1) == 1)
            res = (res * x) % M;
        x = (x * x) % M;
        k >>= 1;
    }
    return res;
}

struct prepare {
	prepare() {
	    cout.setf(ios::fixed, ios::floatfield);
	    cout.precision(8);
	    ios_base::sync_with_stdio(false);
	}
} _prepare;

template <typename T>
class SegTree {
    int n;
    vector<T> dat;

public:
    SegTree(int _n) {
        n = 1;
        while(n < _n) n *= 2;
        dat.resize(2*n-1);
        fill(all(dat), mp(INF, -1));
    }

    void update(int k, T a) {
        k += n - 1;
        dat[k] = a;
        while(k > 0) {
            k = (k-1) / 2;
            dat[k] = mp(min(dat[k*2+1].first, dat[k*2+2].first),
                        max(dat[k*2+1].second, dat[k*2+2].second));
        }
    }

    T _query(int a, int b, int k, int l, int r) {
        if(r <= a || b <= l) return mp(INF,-1);

        if(a <= l && r <= b) return dat[k];
        else {
            T vl = _query(a, b, k*2+1, l, (l+r)/2);
            T vr = _query(a, b, k*2+2, (l+r)/2, r);
            return mp(min(vl.first,vr.first),
                      max(vl.second, vr.second));
        }
    }
    // [a, b)
    T query(int a, int b) {
        return _query(a, b, 0, 0, n);
    }
    // a
    T query(int a) {
        return query(a, a+1);
    }
};


int main() {
    int N, M;
    cin >> N >> M;
    vvi E(M, vi(N));
    rep(i, M) {
        rep(j, N)
            cin >> E[i][j];
    }

    pii ans = mp(-1, -1);

    rep(i, M) {
        int sm = 0;
        SegTree<pii> seg(N);
        rep(j, N)
            seg.update(j, mp(E[i][j], E[i][j]));


        rep(n1_pos, N) {
            int n1 = E[i][n1_pos];
            REP(n2_pos, n1_pos+1, N) {
                int n2 = E[i][n2_pos];

                pii left = seg.query(0, n1_pos);
                pii cen = seg.query(n1_pos+1, n2_pos);
                pii right = seg.query(n2_pos+1, N+1);
//
//                cerr << n1_pos << " : " << n2_pos << endl;
//                cerr << left << endl;
//                cerr << cen << endl;
//                cerr << right << endl;

                int mx = 0;
                if(n1 > n2) {
                    swap(n1, n2);
                    swap(left, right);
                }

                if(left.second != -1 && left.second > n1)
                    chmax(mx, max(left.second, n2));
                if(cen.first != INF && cen.first < n1)
                    chmax(mx, max(cen.first, n2));
                if(cen.second != -1 && cen.second > n2)
                    chmax(mx, max(cen.second, n2));
                if(right.second != INF && right.second < n2)
                    chmax(mx, max(right.second, n2));

                sm += mx;
            }
        }

        if(sm > ans.first)
            ans = mp(sm, i);
    }

    cout << ans.second << endl;

    return 0;
}