#include <bits/stdc++.h>
using namespace std;

int main(){
  int n, m;
  cin >> n >> m;
  int mm[10] = {};
  int kanosei[100010] = {};
  int ans = 0;
  queue<int> kn[10];

  for(int i = 0;i < n;i++){
    int r;
    for(int j = 0;j < m;j++){
      cin >> r;
      if(mm[j] < r){
        while(!kn[j].empty()){
          int t = kn[j].front();
          kn[j].pop();
          kanosei[t]--;
          if(kanosei[t] == 0){
            ans--;
          }
        }
        mm[j] = r;
      }

      if(mm[j] == r){
        if(kanosei[i] == 0){
          ans++;
        }
        kanosei[i]++;
        kn[j].push(i);
      }
    }
    cout << ans << endl;
  }

  return 0;
}