#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N, M;
  cin >> N >> M;
  int R[N][M];

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < M; ++j) {
      cin >> R[i][j];
    }
  }

  set<int> S[N];
  int left = 0;
  int v_counter[N];
  memset(v_counter, 0, sizeof(v_counter));
  int max_values[M];
  memset(max_values, 0, sizeof(max_values));
  int ans = 0;

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < M; ++j) {
      if (max_values[j] < R[i][j]) {
        for (int s : S[j]) {
          v_counter[s]--;
          if (v_counter[s] == 0) {
            --ans;
          }
        }
        S[j].clear();

        v_counter[i]++;
        max_values[j] = R[i][j];
        S[j].insert(i);
      } else if (max_values[j] == R[i][j]) {
        v_counter[i]++;
        S[j].insert(i);
      }
    }
    if (v_counter[i] > 0) {
      ++ans;
    }

    cout << ans << endl;
  }

  return 0;
}