/* -*- coding: utf-8 -*-
 *
 * 709.cc: No.709 優勝可能性 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_M = 10;

/* typedef */

typedef queue<int> qi;

/* global variables */

int maxrs[MAX_M], mis[MAX_N];
qi qs[MAX_M];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  int cnt = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      int rij;
      scanf("%d", &rij);

      if (maxrs[j] < rij) {
	qi &qj = qs[j];
	while (! qj.empty()) {
	  int u = qj.front(); qj.pop();
	  if (--mis[u] == 0) cnt--;
	}
      }

      if (maxrs[j] <= rij) {
	maxrs[j] = rij;
	qs[j].push(i);
	if (mis[i]++ == 0) cnt++;
      }
    }
    printf("%d\n", cnt);
  }
  
  return 0;
}