#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N, M;
	cin >> N >> M;
	vector<vector<int> > A(N, vector<int>(M));
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++) {
			cin >> A[i][j];
		}
	}
	vector<int> C(N, 0);
	vector<int> mx(M, -1);
	vector<vector<int> > l(M);
	int res = 0;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++) {
			if (mx[j] < A[i][j]) {
				mx[j] = A[i][j];
				for (auto a : l[j]) {
					C[a]--;
					if (C[a] == 0)res--;
				}
				l[j].clear();
				l[j].push_back(i);
				if (C[i] == 0)res++;
				C[i]++;
			}
			else if (mx[j] == A[i][j]) {
				l[j].push_back(i);
				if (C[i] == 0)res++;
				C[i]++;
			}
		}
		cout << res << endl;
	}

}