#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n, m;
    cin >> n >> m;
    vector<pair<ll, vector<ll>>> kh(m, make_pair(0, vector<ll>(0)));
    map<ll, ll> cnt;
    rep(i, n) {
        rep(j, m) {
            ll r;
            cin >> r;
            r--;
            if (kh[j].first < r) {
                for(auto &x : kh[j].second) {
                    if (cnt[x] == 1) {
                        cnt.erase(x);
                    }
                    else {
                        cnt[x]--;
                    }
                }
                kh[j] = make_pair(r, vector<ll>(1, i));
                cnt[i]++;
            }
            else if (kh[j].first == r) {
                kh[j].second.push_back(i);
                cnt[i]++;
            }
        }
        cout << sz(cnt) << endl;
    }
    return 0;
}