#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 1007681537;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
const int maxn = 5e4 + 5;
const int maxk = 10 + 5;
int n, k;
int a[maxn][maxk];
int fen[2][maxk][maxn];
void upd(int fen[], int p, int val) {
  for (; p < maxn; p += p & -p) {
    chkmax(fen[p], val);
  }
}
int query(int fen[], int p) {
  int res = 0;
  for (; p > 0; p -= p & -p) {
    chkmax(res, fen[p]);
  }
  return res;
}
int dj[maxn];
int size[maxn];
int f[maxn];
int g[maxn];
void init() {
  for (int i = (1); i < (n + 1); i++) dj[i] = i, size[i] = 1, f[i] = g[i] = i;
}
int find(int u) { return dj[u] == u ? dj[u] : dj[u] = find(dj[u]); }
void join(int u, int v) {
  int p = find(u);
  int q = find(v);
  if (p != q) {
    dj[p] = q;
    size[q] += size[p];
    chkmin(f[q], f[p]);
    chkmax(g[q], g[p]);
  }
}
void solve() {
  cin >> n >> k;
  static vector<int> dc[maxk];
  for (int i = (0); i < (n); i++)
    for (int j = (0); j < (k); j++) {
      cin >> a[i][j];
      dc[j].push_back(a[i][j]);
    }
  for (int i = (0); i < (k); i++) {
    sort((dc[i]).begin(), (dc[i]).end()),
        (dc[i]).erase(unique((dc[i]).begin(), (dc[i]).end()), (dc[i]).end());
  }
  for (int i = (0); i < (n); i++)
    for (int j = (0); j < (k); j++) {
      a[i][j] = lower_bound((dc[j]).begin(), (dc[j]).end(), a[i][j]) -
                dc[j].begin() + 1;
    }
  init();
  set<int> st, heap;
  for (int i = (0); i < (n); i++) {
    st.insert(a[i][0]);
    heap.insert(a[i][0]);
    for (int j = (1); j < (k); j++) {
      int mx = query(fen[0][j], a[i][j]);
      if (a[i][0] < mx) {
        vector<int> vals;
        set<int>::iterator it = st.lower_bound(a[i][0]);
        while (it != st.end() && *it <= mx) {
          vals.push_back(*it);
          it++;
        }
        for (int l = (0); l < (int((vals).size())); l++) {
          st.erase(vals[l]);
          join(mx, vals[l]);
        }
      }
      int mn = n + 1 - query(fen[1][j], n + 1 - a[i][j]);
      if (mn < a[i][0]) {
        vector<int> vals;
        set<int>::iterator it = st.lower_bound(mn);
        while (it != st.end() && *it <= a[i][0]) {
          vals.push_back(*it);
          it++;
        }
        for (int l = (0); l < (int((vals).size())); l++) {
          st.erase(vals[l]);
          join(mn, vals[l]);
        }
      }
      int z = find(a[i][0]);
      st.insert(f[z]);
      st.insert(g[z]);
      upd(fen[0][j], a[i][j], a[i][0]);
      upd(fen[1][j], n + 1 - a[i][j], n + 1 - a[i][0]);
    }
    int k = find(*heap.rbegin());
    cout << size[k] << "\n";
  }
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int JUDGE_ONLINE = 1;
  if (argc > 1) {
    JUDGE_ONLINE = 0;
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    JUDGE_ONLINE = 0;
    assert(freopen(argv[2], "w", stdout));
  }
  solve();
  if (!JUDGE_ONLINE) {
    cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  }
  return 0;
}
