#include using namespace std; typedef long long signed int LL; typedef long long unsigned int LU; #define incID(i, l, r) for(int i = (l) ; i < (r); i++) #define incII(i, l, r) for(int i = (l) ; i <= (r); i++) #define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--) #define decII(i, l, r) for(int i = (r) ; i >= (l); i--) #define inc(i, n) incID(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec(i, n) decID(i, 0, n) #define dec1(i, n) decII(i, 1, n) #define inII(v, l, r) ((l) <= (v) && (v) <= (r)) #define inID(v, l, r) ((l) <= (v) && (v) < (r)) #define PB push_back #define EB emplace_back #define MP make_pair #define FI first #define SE second #define UB upper_bound #define LB lower_bound #define PQ priority_queue #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define FOR(it, v) for(auto it = v.begin(); it != v.end(); ++it) #define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it) template bool setmin(T & a, T b) { if(b < a) { a = b; return true; } else { return false; } } template bool setmax(T & a, T b) { if(b > a) { a = b; return true; } else { return false; } } template bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } } template bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } } template T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); } template T lcm(T a, T b) { return a / gcd(a, b) * b; } // ---- ---- int n, m, e[3][800], s[3][800][800]; int main() { cin >> n >> m; inc(q, m) { inc(i, n) { cin >> e[q][i]; } } int ans_v = 0, ans_i = 0; inc(q, m) { inc(i, n) { inc(j, n) { inc(k, n) { if(k == i || k == j) { continue; } int x[3] = { i, j, k }; int a[3] = { e[q][i], e[q][j], e[q][k] }; sort(x, x + 3); sort(a, a + 3); if(a[1] == e[q][x[1]]) { continue; } setmax(s[q][i][j], a[2]); } } } int v = 0; inc(i, n) { inc(j, n) { v += s[q][i][j]; } } if(setmax(ans_v, v)) { ans_i = q; } } cout << ans_i << endl; return 0; }