#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    vector< vector<int> > cur(m);
    vector< vector<int> > r(n, vector<int>(m));
    map<int, int> cnt;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> r[i][j];
            if (cur[j].empty() || r[i][j] == r[cur[j].front()][j]) {
                cur[j].push_back(i);
                cnt[i]++;
            } else if (r[i][j] > r[cur[j].front()][j])  {
                while (!cur[j].empty()) {
                    cnt[cur[j].back()]--;
                    if (cnt[cur[j].back()] == 0) {
                        cnt.erase(cur[j].back());
                    }
                    cur[j].pop_back();
                }
                cur[j].push_back(i);
                cnt[i]++;
            }
        }

        cout << cnt.size() << endl;
    }
    return 0;
}