#define _CRT_SECURE_NO_WARNINGS
#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<tuple>
#include<unordered_set>
#include<random>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())



int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,m;
	cin >> n >> m;
	int ans;
	int a[800];
	int mah[800], mat[800];
	int mih[800], mit[800];
	int maxv = - 1;
	rep(i,m) {
		rep(j, n)cin >> a[j];
		mah[0] = mih[0] = a[0];
		for (int j = 1; j < n;j++) {
			mah[j] = max(mah[j-1],a[j]);
			mih[j] = min(mih[j-1], a[j]);
		}
		mat[n-1] = mit[n-1] = a[n-1];
		for (int j = n - 2; j >= 0; j--) {
			mat[j] = max(mat[j+1], a[j]);
			mit[j] = min(mit[j+1], a[j]);
		}
		int sum = 0;
		rep(j, n) {
			int ma, mi;
			ma = mi = a[j];
			for (int k = j + 1; k < n; k++) {
				int x = 0;
				if (max(a[j], a[k]) < ma) {
					x = ma;
				}else if (min(a[j], a[k]) > mi) {
					x = max(a[j],a[k]);
				}
				if (a[j] < a[k]) {
					if (mah[j] > a[j])x = max(x, max(a[k], mah[j]));
					else if (mit[k] < a[k])x = max(x, a[k]);
				}
				else if (a[j] > a[k]) {
					if (mat[k] > a[k])x = max(x, max(a[j], mat[k]));
					else if (mih[j] < a[j])x = max(x, a[j]);
				}
				sum += x;
				ma = max(ma, a[k]);
				mi = min(mi, a[k]);
			}
		}
		if (maxv < sum) {
			maxv = sum;
			ans = i;
		}
	}
	cout << ans << endl;

	return 0;
}