20250327

# import math

# n=int(input())

# a=list(map(int,input().split()))

# f=a[0]

# for i in range(1,n):

# m=a[i]

# print(f//math.gcd(f,m),'/',m//math.gcd(f,m),sep='')

# import sys

# sys.setrecursionlimit(10000)

# def koong(n):

# if n!=-1:

# koong(n-1)

# if n<2:

# return 1

# elif n==2:

# return 2

# elif n==3:

# return 4

# else:

# a.append(sum(a))

# del a[0]

# return a[3]

# n=int(input())

# a=[1,1,2,4]

# for i in range(n):

# m=int(input())

# print(koong(m))

# a = [1, 1, 2, 4]

n,m=map(int,input().split())

a=[]

b=[]

memo=[0 for i in range(m)]

for i in range(n):

t=list(map(int,input().split()))

memo[t.index(min(t))]=memo[t.index(min(t))]+1