#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;


int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	ll N, M; scanf("%lld %lld", &N, &M);
	vector<vector<ll>> R(N, vector<ll>(M));
	for (ll i = 0; i < N; i++) for (ll j = 0; j < M; j++) scanf("%lld", &R[i][j]);
	vector<map<ll, ll>> vm(M);
	vector<ll> deg(N);
	vector<stack<pair<ll, ll>>> vs(M);
	ll res = 0;
	for (ll i = 0; i < N; i++) {
		for (ll j = 0; j < M; j++) {
			if (vs[j].empty()) {
				vs[j].emplace(R[i][j], i);
				deg[i]++;
			}
			else {
				if (vs[j].top().first == R[i][j]) {
					vs[j].emplace(R[i][j], i);
					deg[i]++;
				}
				else if (vs[j].top().first < R[i][j]) {
					while (!vs[j].empty()) {
						deg[vs[j].top().second]--;
						if (deg[vs[j].top().second] == 0) res--;
						vs[j].pop();
					}
					vs[j].emplace(R[i][j], i);
					deg[i]++;
				}
			}
		}
		if (deg[i] > 0) res++;
		printf("%lld\n", res);

	}
	return 0;
}