#include<bits/stdc++.h>
# define int long long
# define rep(i, j, k) for (int i = j; i <= k; ++i)
using namespace std;

int n, m, a[300005][25], cnt[25], plc[300005];
int minn[1100005], maxx[1100005];
int num[1100005], fst[1100005], sec[1100005];
void upd(int p, int x){if (fst[p] == x || sec[p] == x) return;
	if (__builtin_popcount(p & plc[x]) > __builtin_popcount(p & plc[sec[p]])) sec[p] = x; if (__builtin_popcount(p & plc[sec[p]]) > __builtin_popcount(p & plc[fst[p]])) swap(fst[p], sec[p]);}
signed main()
{
//	freopen("ex_4.in", "r", stdin);
//	freopen("c.out", "w", stdout);
	ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
	cin >> n >> m;
	rep(i, 0, (1 << m) - 1) minn[i] = 1000000, maxx[i] = 0;
	rep(i, 1, n) rep(j, 1, m) cin >> a[i][j], cnt[j] += a[i][j], plc[i] += !a[i][j] * (1 << (j - 1));
	rep(i, 1, n) minn[plc[i]] = min(minn[plc[i]], i), maxx[plc[i]] = max(maxx[plc[i]], i);
	for (int i = (1 << m) - 1; i >= 0; --i) if (maxx[i]) rep(j, 0, m - 1) if (i & (1 << j)) minn[i ^ (1 << j)] = min(minn[i ^ (1 << j)], minn[i]), maxx[i ^ (1 << j)] = max(maxx[i ^ (1 << j)], maxx[i]);
	rep(i, 0, (1 << m) - 1) {if (maxx[i]) {upd(i, maxx[i]); if (minn[i] != maxx[i]) upd(i, minn[i]);}
		rep(j, 0, m - 1) if (i & (1 << j)) {if (fst[i ^ (1 << j)]) {upd(i, fst[i ^ (1 << j)]); if (sec[i ^ (1 << j)]) upd(i, sec[i ^ (1 << j)]);}}}
	rep(i, 1, n)
	{
		int nnn = 0, al = 0;
		rep(j, 1, m) if (cnt[j] - a[i][j] == n / 2) nnn ^= (1 << (j - 1)); else if (cnt[j] - a[i][j] > n / 2) ++al;
		if (fst[nnn] == i) cout << al + __builtin_popcount(nnn & plc[sec[nnn]]) << '\n'; else cout << al + __builtin_popcount(nnn & plc[fst[nnn]]) << '\n';
	}
	return 0;
}