#include <iostream>
#include <vector>

void solve() {
    int n, m;
    std::cin >> n >> m;

    std::vector<int> cnt(n, 0), maxs(m, 0);
    std::vector<std::vector<int>> bests(m);
    int ans = 0;

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            int x;
            std::cin >> x;

            if (x > maxs[j]) {
                for (auto k : bests[j]) {
                    if (--cnt[k] == 0) --ans;
                }
                bests[j].clear();
                maxs[j] = x;
            }

            if (x == maxs[j]) {
                if (cnt[i]++ == 0) ++ans;
                bests[j].push_back(i);
            }
        }

        std::cout << ans << "\n";
    }
}

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

    solve();

    return 0;
}