#include <bits/stdc++.h>
using namespace std;

const int maxn = 3e5 + 5;
const int N = 1.1e6 + 5;

int a[maxn][21], cnt[21];
int fir[N], sec[N], pos[N], pos2[N];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		int nw = 0;
		for (int j = 0; j < m; j++)
		{
			cin >> a[i][j];
			cnt[j] += a[i][j];
			if (!a[i][j]) nw |= (1 << j);
		}
		fir[nw] = 1;
		pos[nw] = (pos[nw] ? n + 1 : i);
	}
	
	int M = 1 << m;
	for (int st = M - 1; ~st; st--)
	{
		int p = pos[st];
		for (int i = 0; i < m; i++)
			if (!(st & (1 << i)) && fir[st ^ (1 << i)])
			{
				if (!p) p = pos[st ^ (1 << i)];
				else if (p != pos[st ^ (1 << i)]) p = n + 1;
			}
		if (p) fir[st] = 1, pos[st] = p;
	}
	
	for (int st = 0; st < M; st++)
		if (fir[st]) fir[st] = __builtin_popcount(st);
	
	for (int st = 0; st < M; st++)
	{
		int spos = 0;
		for (int i = 0; i < m; i++)
			if (st & (1 << i))
			{
				int nw = st ^ (1 << i);
				if (sec[st] < fir[nw])
				{
					if (pos[nw] == pos[st])
					{
						fir[st] = max(fir[st], fir[nw]);
						if (sec[st] < sec[nw])
						{
							sec[st] = sec[nw];
							spos = pos2[nw];
						}
						else if (sec[st] == sec[nw] && spos != pos2[nw]) spos = n + 1;
					}
					else
					{
						sec[st] = fir[nw];
						spos = pos[nw];
					}
				}
				else if (sec[st] == fir[nw] && spos != pos[nw]) spos = n + 1;
				if (sec[st] > fir[st]) swap(sec[st], fir[st]), swap(spos, pos[st]);
			}
		pos2[st] = spos;
	}
	
	int k = n / 2;
	for (int i = 1; i <= n; i++)
	{
		int ans = 0, nw = 0;
		for (int j = 0; j < m; j++)
		{
			if (cnt[j] > k + 1) ans++;
			else if (cnt[j] == k + 1)
			{
				if (a[i][j]) nw |= (1 << j);
				else ans++;
			}
			else if (cnt[j] == k && !a[i][j]) nw |= (1 << j);
		}
		cout << ans + (i == pos[nw] ? sec[nw] : fir[nw]) << "\n";
	}
	return 0;
}