#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;

inline bool cheak(ll x, ll y, ll xMax, ll yMax) { return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toint(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string tostring(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
template<class T> inline T mypow(T x, ll n) { T res = 1; while (n > 0) { if (n & 1)res = res * x;	x = x * x;	n >>= 1; }return res; }
inline int gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline int lcm(ll a, ll b) { return a / gcd(a, b) * b; }

#define For(i,a,b)	for(ll (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define rFor(i,a,b)	for(ll (i) = (a-1);i >= (b);(i)--)
#define rrep(i,n)	rFor(i,n,0)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))
#define tostr(a)	tostring(a)
#define dump(val) 	cerr << #val " = " << val << endl;
#define fil(a,v)	fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)

const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };

const ll mod = 1e9 + 7;
const ll INF = 1e18;

#define int ll

bool ok(int a,int b,int c) {
	if (c < a && a < b)return true;
	if (a < c && c < b)return true;
	if (b < a && a < c)return true;
	if (b < c && c < a)return true;
	return false;
}


signed main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	int n, m;
	cin >> n >> m;
	vector<vector<double>> E(m, vector<double>(n));
	rep(i, m)rep(j, n) {
		cin >> E[i][j];
	}
	P ans(-1, -1);
	rep(_, m) {
		double v = 0;
		rep(i, n)rep(j, n)if (i != j){
			double ma = 0;
			rep(k, n) if(k != i && k != j) {
				int ti = i, tj = j, tk = k;
				if (ti > tj)swap(ti, tj);
				if (ti > tk)swap(ti, tk);
				if (tj > tk)swap(tj, tk);
				if (ok(E[_][ti], E[_][tj], E[_][tk])) {
					ma = max({ ma,E[_][ti], E[_][tj], E[_][tk] });
				}
			}
			v +=  ma / (n * (n - 1) / 2);
		}
		ans = max(P(v, _), ans);
	}
	cout << ans.second << endl;

	return 0;
}