import java.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.math.BigInteger;

public class Main{

static PrintWriter out;
static InputReader ir;

static void solve(){
 int n=ir.nextInt();
 int m=ir.nextInt();
 int[][] a=new int[m][];
 for(int i=0;i<m;i++){
  a[i]=ir.nextIntArray(n);
  for(int j=0;j<n;j++) a[i][j]--;
 }
 int[] po=new int[n];
 int ans=-1,num=-1;
 for(int i=0;i<m;i++){
  for(int j=0;j<n;j++) po[a[i][j]]=j;
  int tot=0;
  for(int j=0;j<n;j++){
   for(int k=j+1;k<n;k++){
    int s=po[a[i][j]],t=po[a[i][k]],p=a[i][j],q=a[i][k];
    if(s>t){
     int temp=s;
     s=t;
     t=temp;
     temp=p;
     p=q;
     q=temp;
    }
    int ma=0;
    if(p>q){
     for(int l=0;l<n;l++){
      if(l==p||l==q) continue;
      if(po[l]<s&&l<p) ma=Math.max(ma,l);
      if(po[l]>s&&po[l]<t&&((l>p&&l>q)||(l<p&&l<q))) ma=Math.max(ma,l);
      if(po[l]>t&&l>q) ma=Math.max(ma,l);
     }
    }
    else{
     for(int l=0;l<n;l++){
      if(l==p||l==q) continue;
      if(po[l]<s&&l>p) ma=Math.max(ma,l);
      if(po[l]>s&&po[l]<t&&((l>p&&l>q)||(l<p&&l<q))) ma=Math.max(ma,l);
      if(po[l]>t&&l<q) ma=Math.max(ma,l);
     }
    }
    tot+=ma;
   }
  }
  if(ans<tot){
   ans=tot;
   num=i;
  }
 }
 out.println(num);
}

public static void main(String[] args) throws Exception{
 ir=new InputReader(System.in);
 out=new PrintWriter(System.out);
 solve();
 out.flush();
}

static class InputReader {
 private InputStream in;
 private byte[] buffer=new byte[1024];
 private int curbuf;
 private int lenbuf;

 public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}
 
 public boolean hasNextByte() {
  if(curbuf>=lenbuf){
   curbuf= 0;
   try{
    lenbuf=in.read(buffer);
   }catch(IOException e) {
    throw new InputMismatchException();
   }
   if(lenbuf<=0) return false;
  }
  return true;
 }

 private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}
 
 private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}
 
 private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}
 
 public boolean hasNext(){skip(); return hasNextByte();}
 
 public String next(){
  if(!hasNext()) throw new NoSuchElementException();
  StringBuilder sb=new StringBuilder();
  int b=readByte();
  while(!isSpaceChar(b)){
   sb.appendCodePoint(b);
   b=readByte();
  }
  return sb.toString();
 }
 
 public int nextInt() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  int res=0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }
 
 public long nextLong() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  long res = 0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }

 public double nextDouble(){return Double.parseDouble(next());}

 public BigInteger nextBigInteger(){return new BigInteger(next());}

 public int[] nextIntArray(int n){
  int[] a=new int[n];
  for(int i=0;i<n;i++) a[i]=nextInt();
  return a;
 }

 public long[] nextLongArray(int n){
  long[] a=new long[n];
  for(int i=0;i<n;i++) a[i]=nextLong();
  return a;
 }

 public char[][] nextCharMap(int n,int m){
  char[][] map=new char[n][m];
  for(int i=0;i<n;i++) map[i]=next().toCharArray();
  return map;
 }
}
}