import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')




proc solve()=
  var
    n = scan()
    m = scan()
    r = newseqwith(n,newseqwith(m,scan()))
    maxParam = newseqwith(m,0)
    maxParamPlayer = newseqwith(m,initHashSet[int]())
    isMax = newseqwith(n,0)
    ninzuu:int
  for k in 0..<n:
    for p in 0..<m:
      if maxparam[p] < r[k][p]:
        for player in maxParamPlayer[p]:
          isMax[player]-=(1 shl p)
          if isMax[player] == 0:
            ninzuu-=1
        maxparam[p] = r[k][p]
        maxParamPlayer[p].clear()
      if maxparam[p] == r[k][p]:
        maxParamPlayer[p].incl(k)
        if isMax[k] == 0:
          ninzuu+=1
        isMax[k] += 1 shl p
    
    echo ninzuu


  

  
solve()