#include <bits/stdc++.h>
const int MaxN = 5e4 + 50;
int n, K;
struct Node {
  int L[10], R[10];
  mutable int siz;
  inline bool operator<(const Node &nt) const {
    for (int i = 0; i < K; ++i)
      if (R[i] > nt.L[i]) return false;
    return true;
  }
} a[MaxN];
template <class t>
inline void read(t &s) {
  s = 0;
  register int f = 1;
  register char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) s = (s << 3) + (s << 1) + (c ^ 48), c = getchar();
  s *= f;
  return;
}
template <class t, class... A>
inline void read(t &x, A &...a) {
  read(x);
  read(a...);
}
template <class t>
inline void write(t x) {
  if (x < 0) putchar('-'), x = -x;
  int buf[21], top = 0;
  while (x) buf[++top] = x % 10, x /= 10;
  if (!top) buf[++top] = 0;
  while (top) putchar(buf[top--] ^ '0');
  return;
}
inline void setIn(std::string s) {
  freopen(s.c_str(), "r", stdin);
  return;
}
inline void setOut(std::string s) {
  freopen(s.c_str(), "w", stdout);
  return;
}
inline void setIO(std::string s = "") {
  setIn(s + ".in");
  setOut(s + ".out");
  return;
}
template <class t>
inline bool checkmin(t &x, t y) {
  if (x > y) {
    x = y;
    return 1;
  }
  return 0;
}
template <class t>
inline bool checkmax(t &x, t y) {
  if (x < y) {
    x = y;
    return 1;
  }
  return 0;
}
inline int lowbit(int x) { return x & (-x); }
std::multiset<Node> S;
signed main(void) {
  read(n, K);
  for (int i = 1; i <= n; a[i].siz = 1, ++i)
    for (int j = 0; j < K; ++j) read(a[i].L[j]), a[i].R[j] = a[i].L[j];
  for (int i = 1; i <= n; ++i) {
    register std::multiset<Node>::iterator it;
    while ((it = S.find(a[i])) != S.end()) {
      for (int j = 0; j < K; ++j)
        checkmin(a[i].L[j], it->L[j]), checkmax(a[i].R[j], it->R[j]);
      a[i].siz += it->siz, S.erase(it);
    }
    S.insert(a[i]);
    write(S.rbegin()->siz), std::puts("");
  }
  return 0;
}
