#include<bits/stdc++.h>
using namespace std;

//#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

const int SIZE=888;

int N,M;
int E[SIZE];

int ma[SIZE][SIZE],mi[SIZE][SIZE];

int get(){
    rep(i,N)cin>>E[i];
    rep(i,N){
      ma[i][i]=mi[i][i]=E[i];
      reps(j,i+1,N){
        ma[i][j]=max(ma[i][j-1],E[j]);
        mi[i][j]=min(mi[i][j-1],E[j]);
      }
    }

    int ret=0;
    rep(i,N){
      reps(j,i+1,N){
        int z=0;

        int t=ma[i+1][j-1];
        if(t>max(E[i],E[j]))chmax(z,t);
        t=mi[i+1][j-1];
        if(t<min(E[i],E[j])&&t)chmax(z,max(E[i],E[j]));

        if(E[i]>E[j]){
          t=(i?mi[0][i-1]:0);
          if(t<E[i]&&t)chmax(z,E[i]);
          t=(j!=N-1)?ma[j+1][N-1]:0;
          if(t>E[j]&&t)chmax(z,max(E[i],t));
        }
        else{
          t=i?ma[0][i-1]:0;
          if(t>E[i]&&t)chmax(z,max(E[j],t));
          t=(j!=N-1)?mi[j+1][N-1]:0;
          if(t<E[j]&&t)chmax(z,E[j]);
        }
        ret+=z;
      }
    }
    return ret;
}

int main(){
    cin>>N>>M;

    int idx=0,val=0;
    rep(i,M){
      int tmp=get();
      if(tmp>val){
          val=tmp;
          idx=i;
      }
    }
    cout<<idx<<endl;
    return 0;
}