import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    inf=10**9
    n,m=MI()
    ss=[]
    for _ in range(m):
        ee=LI()
        lmx = [0] * n
        lmn = [0] * n
        rmx = [0] * n
        rmn = [0] * n
        mx=-inf
        mn=inf
        for i,e in enumerate(ee):
            lmx[i]=mx
            lmn[i]=mn
            if e>mx:mx=e
            if e<mn:mn=e
        mx=-inf
        mn=inf
        for i,e in enumerate(ee[::-1]):
            rmx[n-1-i]=mx
            rmn[n-1-i]=mn
            if e>mx:mx=e
            if e<mn:mn=e
        #print(lmx)
        #print(lmn)
        #print(rmx)
        #print(rmn)
        s=0
        for j in range(n):
            for i in range(j):
                a,b=ee[i],ee[j]
                if a<b:
                    if lmx[j]>b:s+=lmx[j]
                    elif lmx[i]>a or rmn[j]<b or min(ee[i+1:j])<a:s+=b
                else:
                    if rmx[i]>a:s+=rmx[i]
                    elif rmx[j]>b or lmn[i]<a or min(ee[i+1:j])<b:s+=a
        ss.append(s)
    #print(ss)
    mx=max(ss)
    for i in range(m):
        if ss[i]==mx:
            print(i)
            break

main()