#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int n, m, A[800], d;
ll ans = -1, idx, _ans;
typedef set<int, greater<int> > si;

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m;
  si sl, sm, sr, _sr;
  FOR(i, 0, m){
    _ans = 0;
    FOR(j, 0, n) cin >> A[j];
    sl.clear();
    _sr = si(A, A+n);
    FOR(j, 0, n-1){
      sm.clear();
      sl.insert(A[j]);
      _sr.erase(A[j]);
      sr = si(_sr);
      FOR(k, j+1, n){
        sm.insert(A[k]);
        sr.erase(A[k]);
        d = 0;
        if(A[j] < A[k]){
          if((!sl.empty()) && (*sl.begin() > A[j])) maxs(d, *sl.begin());
          if((!sm.empty()) && (*sm.begin() > A[k])) maxs(d, *sm.begin());
          if(sm.upper_bound(A[j]) != sm.end()) maxs(d, *sm.upper_bound(A[j]));
          if(sr.upper_bound(A[k]) != sr.end()) maxs(d, *sr.upper_bound(A[k]));
        }else{
          if(sl.upper_bound(A[j]) != sl.end()) maxs(d, *sl.upper_bound(A[j]));
          if((!sm.empty()) && (*sm.begin() > A[j])) maxs(d, *sm.begin());
          if(sm.upper_bound(A[k]) != sm.end()) maxs(d, *sm.upper_bound(A[k]));
          if((!sr.empty()) && (*sr.begin() > A[k])) maxs(d, *sr.begin());
        }
        if(d > 0){
          maxs(d, A[j]);
          maxs(d, A[k]);
        }
        _ans += d;
      }
    }
    if(ans < _ans){
      idx = i;
      ans = _ans;
    }
  }
  cout << idx << endl;
  return 0;
}