#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int getmax(const set<int> &s, int lo, int up) {
	auto it = s.upper_bound(up);
	if(it == s.begin())
		return -1;
	-- it;
	if(*it < lo)
		return -1;
	return *it;
}

int main() {
	int NN; int M;
	while(~scanf("%d%d", &M, &NN)) {
		pair<int, int> ans(-1, -1);
		rep(ix, NN) {
			vector<int> A(M);
			for(int i = 0; i < M; ++ i)
				scanf("%d", &A[i]);
			int sum = 0;
			rep(i, M) {
				set<int> left, mid, right;
				rep(j, i)
					left.insert(A[j]);
				reu(j, i + 1, M)
					right.insert(A[j]);
				reu(j, i + 1, M) {
					right.erase(A[j]);
					int a = A[i], b = A[j];
					int c = -1;
					if(a < b) {
						amax(c, getmax(left, a + 1, M));
						amax(c, getmax(mid, b + 1, M));
						amax(c, getmax(mid, 1, a - 1));
						amax(c, getmax(right, 1, b - 1));
					} else {
						amax(c, getmax(left, 1, a - 1));
						amax(c, getmax(mid, a + 1, M));
						amax(c, getmax(mid, 1, b - 1));
						amax(c, getmax(right, b + 1, M));
					}
					if(c != -1) {
						amax(c, a);
						amax(c, b);
						sum += c;
					}
//					cerr << a << ", " << b << ": " << c << endl;
					mid.insert(A[j]);
				}
			}
			amax(ans, mp(sum, -ix));
		}
		printf("%d\n", -ans.second);
	}
	return 0;
}