#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#include<set>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}
int main()
{
  ll N,M,in,res=0,p=0,deg[100001];
  fill(deg,deg+100001,0);
  int m[10];
  fill(m,m+10,-1);
  map<int,int> mp;
  set<int> sets[10];
  cin >> N >> M;
  REP(i,N){
    REP(j,M){
      cin >> in;
      if(m[j] < in){
        for(auto itr=sets[j].begin();itr!=sets[j].end();++itr){
          deg[*itr]--;
          if(deg[*itr] == 0)
            p--;
        }
        m[j] = in;
        deg[i]++;
        if(deg[i] == 1)
          p++;
        sets[j].clear();
        sets[j].insert(i);
      }else if(m[j] == in){
        deg[i]++;
        if(deg[i] == 1)
          p++;
        sets[j].insert(i);
      }
    }
    cout << p << endl;
  }
  return 0;
}

int par[MAX_N];
int ranks[MAX_N];

//n要素で初期化
void init(int n){
  REP(i,n){
    par[i] = i;
    ranks[i] = 0;
  }

}

//木の根を求める
int find(int x){
  if(par[x] == x){
    return x;
  }else{
    return par[x] = find(par[x]);
  }
}

void unite(int x,int y){
  x = find(x);
  y = find(y);
  if(x == y) return ;
  if(ranks[x] < ranks[y]){
    par[x] = y;
  }else{
    par[y] = x;
    if(ranks[x] == ranks[y]) ranks[x]++;
  }
}

bool same(int x, int y){
  return find(x) == find(y);
}