#include "bits/stdc++.h"
#include<unordered_map>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;

bool check(int l, int m, int r) {
	return (m > l&&m > r) || (m < l&&m < r);
}
int main() {
	int N, M; cin >> N >> M;
	vector<pair<long long int,int>>kitais(M);
	for (int i = 0; i < M; ++i) {
		long long nkitai = 0;
		vector<int>es;
		for (int j = 0; j < N; ++j) {
			int e; cin >> e; es.push_back(e);
		}
		for (int j = 0; j < N; ++j) {
			for (int k = j+1; k < N; ++k) {
					int nmoney = 0;
					for (int l = 0; l < j; ++l) {
						if (es[l] >nmoney) {
							if (check(es[l], es[j], es[k]))nmoney =max(nmoney,es[l]);
						}
					}
					for (int l = j+1; l < k; ++l) {
						if (es[l] >nmoney) {
							if (check(es[j], es[l], es[k]))nmoney = max(nmoney, es[l]);
						}
					}
					if (nmoney == N) {
						nkitai += nmoney;
						continue;
					}
					for (int l = k + 1; l < N; ++l) {
						if (es[l] >nmoney) {
							if (check(es[j], es[k], es[l]))nmoney = max(nmoney, es[l]);
						}
					}
					nkitai += nmoney;
				
			}
		}
		kitais[i] = make_pair(nkitai, 10-i);
	}
	cout << 10-(*max_element(kitais.begin(), kitais.end())).second << endl;
	return 0;
}