#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };



int main() {
	int n, m;
	cin >> n >> m;

	vector<int>p[11];
	vector<int>ind(101010);
	vector<int>mxli(m,0);
	int ans = 0;
	rep(i, 0, n) {
		int ok = 0;
		rep(j, 0, m) {
			int temp;
			cin >> temp;
			if (mxli[j] <= temp) {
				ok = 1;
				if (mxli[j] < temp) {
					fore(x, p[j]) {
						ind[x]--;
						if (ind[x] == 0)ans--;
					}
					p[j].clear();
				}
				mxli[j] = temp;
				ind[i]++;
				p[j].pb(i);
			}
		}
		if (ok)ans++;
		cout << ans << endl;
	}

	return 0;
}