import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}
void readA(T)(size_t n,ref T[]t){t=new T[](n);auto r=rdsp;foreach(ref v;t)pick(r,v);}

void main()
{
  int n, m; readV(n, m);

  auto s = new int[](m), t = new int[][](m);
  auto u = new int[](n), v = 0;
  foreach (i; 0..n) {
    int[] r; readA(m, r);
    foreach (j; 0..m) {
      if (r[j] > s[j]) {
        foreach (ti; t[j]) {
          --u[ti];
          if (u[ti] == 0) --v;
        }
        t[j] = [i];
        ++u[i];
        if (u[i] == 1) ++v;
        s[j] = r[j];
      } else if (r[j] == s[j]) {
        t[j] ~= i;
        ++u[i];
        if (u[i] == 1) ++v;
      }
    }
    writeln(v);
  }
}