import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline()[:-1]
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    n,m=MI()
    mem=[set() for _ in range(m)]
    val=[-1]*m
    for i in range(n):
        rr=LI()
        for j,r in enumerate(rr):
            if r>val[j]:
                val[j]=r
                mem[j].clear()
                mem[j].add(i)
            if r==val[j]:
                mem[j].add(i)
        s=set()
        for ms in mem:s|=ms
        print(len(s))

main()