#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; const int INF = 1e9; const ll LINF = 1e18; inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; } template ostream& operator << (ostream& out,const pair& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template ostream& operator << (ostream& out,const vector V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template ostream& operator << (ostream& out,const vector > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template ostream& operator << (ostream& out,const map mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ bool kadomatsu(int a,int b,int c){ if(b>a&&b>c)return true; if(b> N >> M; vector> E(M,vector(N)); for(auto& vec:E) for(auto& in:vec) cin >> in; int maxv = 0; for(int _ = 0; _ < M; _++){ int T = 0; const vector& e = E[_]; for(int i = 0; i < N;i++){ for(int k = i+2; k < N;k++){ int t = 0; for(int j = i+1; j < k;j++){ if(kadomatsu(e[i], e[j], e[k])){ t = max({t,e[i],e[j],e[k]}); } } T += t; } } if(T > maxv){ maxv = T; res = _; } } return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cout << solve() << endl; return 0; }