#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

int main(void) {
  ll N, M;
  cin >> N >> M;
  vector<vector<ll>> R(N, vector<ll>(M));
  REP(i, 0, N) REP(j, 0, M) cin >> R[i][j];

  vector<vector<ll>> current(M);
  vector<ll> cnt(N, 0);
  vector<ll> value(M, 0);
  ll ans = 0;
  REP(i, 0, N) {
    bool ok = false;
    REP(j, 0, M) {
      if(value[j] < R[i][j]) {
        cnt[i]++;
        for(ll k : current[j]) {
          cnt[k]--;
          if(cnt[k] == 0) ans--;
        }
        value[j] = R[i][j];
        current[j].clear();
        current[j].push_back(i);
        ok = true;
      } else if(value[j] == R[i][j]) {
        cnt[i]++;
        current[j].push_back(i);
        ok = true;
      }
    }
    if(ok) ans++;
    cout << ans << endl;
  }
}