#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long n, long long m) {
  long long ret = n % m;
  if (ret < 0) ret += m;
  return ret;
}
long long gcd(long long a, long long b) {
  return (b == 0LL ? a : gcd(b, a % b));
}
long long exp(long long a, long long b, long long m) {
  if (b == 0LL) return 1LL;
  if (b == 1LL) return mod(a, m);
  long long k = mod(exp(a, b / 2, m), m);
  if (b & 1LL) {
    return mod(a * mod(k * k, m), m);
  } else
    return mod(k * k, m);
}
const long long N = 50100;
const long long K = 10;
long long k;
struct coisa {
  vector<long long> L, R;
  long long tam;
  coisa() {
    L = R = vector<long long>(k, 0);
    tam = 1;
  }
  coisa(vector<long long> v) {
    L = R = v;
    tam = 1;
  }
  coisa operator+(const coisa& o) const {
    coisa r;
    for (long long i = 0; i < (k); ++i) r.L[i] = min(L[i], o.L[i]);
    for (long long i = 0; i < (k); ++i) r.R[i] = max(R[i], o.R[i]);
    r.tam = tam + o.tam;
    return r;
  }
  bool operator<(const coisa& o) const {
    for (long long i = 0; i < (k); ++i)
      if (L[i] < o.R[i]) return false;
    return true;
  }
};
vector<long long> vec[N];
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n;
  cin >> n >> k;
  for (long long i = 0; i < (n); ++i) {
    vec[i].resize(k);
    for (long long j = 0; j < (k); ++j) {
      cin >> vec[i][j];
    }
  }
  set<coisa> S;
  for (long long i = 0; i < n; i++) {
    coisa cur = coisa(vec[i]);
    auto it = S.lower_bound(cur);
    auto fim = S.upper_bound(cur);
    cout.flush();
    while (it != fim) {
      cur = cur + *it;
      S.erase(it++);
    }
    S.insert(cur);
    cout << S.begin()->tam << "\n";
  }
}
