import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt(); const M = readInt(); auto R = new int[][](N, M); foreach (i; 0 .. N) foreach (j; 0 .. M) { R[i][j] = readInt(); } int now; auto cnt = new int[N]; void add(int i) { if (cnt[i] == 0) { ++now; } ++cnt[i]; } void rem(int i) { --cnt[i]; if (cnt[i] == 0) { --now; } } auto mxs = new int[M]; auto iss = new int[][M]; foreach (i; 0 .. N) { foreach (j; 0 .. M) { if (chmax(mxs[j], R[i][j])) { foreach (ii; iss[j]) { rem(ii); } } if (mxs[j] == R[i][j]) { iss[j] ~= i; add(i); } } writeln(now); } } } catch (EOFException e) { } }