#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int SZ = 505;

int n, h, a[SZ][SZ], g[SZ][SZ], ans[SZ], c[SZ];
pii ev[30303030];

int f(int u, int v, int t) {
	return 3 * n * u + 3 * v + t;
}
int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);

	cin >> n >> h;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < h; j++) {
			cin >> a[i][j];
		}
		sort(a[i], a[i] + h);
	}
	int sp = 0;
	auto add = [&](pii elt) {
		if (sp == 0 || ev[sp - 1].ss != elt.ss) ev[sp++] = elt;
	};
	for (int u = 0; u < n; u++) {
		for (int v = 0; v < u; v++) {
			int el = 3 * n * u + 3 * v;
			ll s = 0, t = 0;
			int prv = 0;
			for (int i = 0, j = 0, p = 0, q = 0; i < h || j < h; i = p, j = q) {
				int mn = 1e9;
				if (i != h) mn = min(mn, a[u][i]);
				if (j != h) mn = min(mn, a[v][j]);
				while (p < h && a[u][p] == mn) ++p;
				while (q < h && a[v][q] == mn) ++q;
				ll a = h - i;
				ll b = h - j;
				ll x = s;
				ll y = a * (mn - prv) + s;
				ll z = t;
				ll w = b * (mn - prv) + t;
				if (x == z) {
					add({prv, el + 1});
					if (prv + 1 != mn) {
						if (y > w) add({prv + 1, el + 2});
						if (y < w) add({prv + 1, el + 0});
					}
				}
				else if (x > z) {
					if (y >= w) add({prv, el + 2});
					else {
						ll p = s - t;
						ll q = b - a;
						if (q < 0) p *= -1, q *= -1;
						if (p % q == 0) {
							add({prv, el + 2});
							add({prv + p / q, el + 1});
							if (prv + p / q + 1 != mn) add({prv + p / q + 1, el + 0});
						}
						else {
							ll x = prv + p / q;
							add({prv, el + 2});
							if (x + 1 != mn) add({x + 1, el + 0});
						}
					}
				}
				else {
					if (y <= w) add({prv, el + 0});
					else {
						ll p = s - t;
						ll q = b - a;
						if (q < 0) p *= -1, q *= -1;
						if (p % q == 0) {
							add({prv, el + 0});
							add({prv + p / q, el + 1});
							if (prv + p / q + 1 != mn) add({prv + p / q + 1, el + 2});
						}
						else {
							ll x = prv + p / q;
							add({prv, el + 0});
							if (x + 1 != mn) add({x + 1, el + 2});
						}
					}
				}
				s += 1ll * (h - i) * (mn - prv);
				t += 1ll * (h - j) * (mn - prv);
				prv = mn;
			}
			if (s < t) add({prv, el + 0});
			if (s == t) add({prv, el + 1});
			if (s > t) add({prv, el + 2});
		}
	}
	sort(ev, ev + sp);
	for (int v = 0; v < n; v++) ans[v] = n;
	for (int u = 0; u < n; u++) {
		for (int v = 0; v < u; v++) {
			g[u][v] = 1;
			c[u]++;
			c[v]++;
		}
	}
	for (int i = 0, p = 0; i < sp; i = p) {
		while (p < sp && ev[i].ff == ev[p].ff) {
			int u = ev[p].ss / (3 * n);
			int v = ev[p].ss / 3 % n;
			int t = ev[p].ss % 3;

			if (g[u][v] == 0) --c[v];
			if (g[u][v] == 1) --c[u], --c[v];
			if (g[u][v] == 2) --c[u];
			g[u][v] = t;
			if (g[u][v] == 0) ++c[v];
			if (g[u][v] == 1) ++c[u], ++c[v];
			if (g[u][v] == 2) ++c[u];
			++p;
		}
		for (int j = i; j < p; j++) {
			int u = ev[j].ss / (3 * n);
			int v = ev[j].ss / 3 % n;
			ans[u] = min(ans[u], c[u]);
			ans[v] = min(ans[v], c[v]);
		}
	}
	for (int v = 0; v < n; v++) cout << ans[v] + 1 << '\n';
}