#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int solve(const vector<int>& e)
{
    int n = e.size();
    set<int> left;

    int ans = 0;
    for(int i=0; i<n; ++i){
        set<int> right;
        for(int j=i+1; j<n; ++j)
            right.insert(e[j]);

        int minMiddle = INT_MAX;
        int maxMiddle = INT_MIN;
        for(int j=i+1; j<n; ++j){
            right.erase(e[j]);

            int value = 0;
            if(e[i] < e[j]){
                if(!left.empty() && *left.rbegin() > e[i])
                    value = max(value, max(e[j], *left.rbegin()));
                if(!right.empty() && *right.begin() < e[j])
                    value = max(value, e[j]);
            }
            else{
                if(!left.empty() && *left.begin() < e[i])
                    value = max(value, e[i]);
                if(!right.empty() && *right.rbegin() > e[j])
                    value = max(value, max(e[i], *right.rbegin()));
            }
            if(minMiddle < min(e[i], e[j]))
                value = max(value, max(e[i], e[j]));
            if(max(e[i], e[j]) < maxMiddle)
                value = max(value, maxMiddle);
            ans += value;

            minMiddle = min(minMiddle, e[i]);
            maxMiddle = max(maxMiddle, e[i]);
        }

        left.insert(e[i]);
    }

    return ans;
}

int main()
{
    int n, m;
    cin >> n >> m;

    int ans = -1;
    int maxValue = -1;
    for(int i=0; i<m; ++i){
        vector<int> e(n);
        for(int j=0; j<n; ++j)
            cin >> e[j];

        int value = solve(e);
        if(value > maxValue){
            ans = i;
            maxValue = value;
        }
    }
    cout << ans << endl;

    return 0;
}