N, M = map(int, input().split())
v_max = -1
ans = None

for m in range(M):
    E = list(map(lambda x: x-1, map(int, input().split())))
    idx = [-1]*N
    
    for i in range(N):
        idx[E[i]] = i
    
    v = 0
    
    for i in range(N):
        for j in range(i+1, N):
            prof = 0
            
            for k in range(N):
                if k in [i, j]:
                    continue
                
                l = [(i, idx[i]), (j, idx[j]), (k, idx[k])]
                l.sort(key=lambda k: k[1])
                l2 = [li[0] for li in l]
                
                if (l2[0]<l2[1] and l2[1]>l2[2]) or (l2[0]>l2[1] and l2[1]<l2[2]):
                    prof = max(prof, max(i, j, k))
            
            v += prof
            
    if v_max<v:
        v_max = v
        ans = m
    
print(ans)