#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, M;
	cin >> N >> M;
	vector R(N, vector<int>(M));
	REP(i, N) REP(j, M) scanf("%d", &R[i][j]);
	vector<int> cnt(N), mx(M, 0);
	vector<vector<int>> mxlist(M);
	int ans = 0;
	REP(i, N) {
		REP(j, M) {
			if (R[i][j] >= mx[j]) {
				if (R[i][j] > mx[j]) {
					mx[j] = R[i][j];
					for (int u : mxlist[j]) if (--cnt[u] == 0) --ans;
					mxlist[j].clear();
				}
				mxlist[j].emplace_back(i);
				if (cnt[i]++ == 0) ++ans;
			}
		}
		printf("%d\n", ans);
	}
}