#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=1000;

int N,M;
int E[SIZE],data[SIZE][SIZE];

set<int>s;
void init(){s.clear();s.insert(0);}
int get(int x){
    set<int>::iterator it=s.upper_bound(x);
    it--;
    return *it;
}

int getScore(){
    memset(data,0,sizeof(data));
    rep(i,N)cin>>E[i];
    init();
    rep(i,N){
        reps(j,i+1,N){
            data[i][j]=0;
            int a=E[i],b=E[j];
            if(a>b){
                if(get(a))data[i][j]=a;            }
            else{
                int v=get(N);
                if(v>a)data[i][j]=max(v,b);
            }
        }
        s.insert(E[i]);
    }
    init();
    for(int i=N-1;i>=0;i--){
        for(int j=i-1;j>=0;j--){
            int a=E[j],b=E[i];
            if(b>a){
                if(get(b))chmax(data[j][i],b);
            }
            else{
                int v=get(N);
                if(v>b)chmax(data[j][i],max(v,a));
            }
        }
        s.insert(E[i]);
    }

    rep(i,N){
        init();
        reps(j,i+1,N){
            int a=E[i],b=E[j];
            int v=get(N);
            if(v>max(a,b))chmax(data[i][j],v);
            if(get(min(a,b))!=0)chmax(data[i][j],max(a,b));
            s.insert(b);
        }
    }

    int score=0;
    rep(i,N)reps(j,i+1,N)score+=data[i][j];
    return score;
}

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

    int idx=0,maxScore=0;
    rep(i,M){
        int score=getScore();
        if(maxScore<score){
            maxScore=score;
            idx=i;
        }
    }
    cout<<idx<<endl;
    return 0;
}