#include<iostream>
#include<cstdio>
#define N 300000
#define M 20
#define inf 1e9
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
void Adder(int &x,int d)
{
    x=(x<d)?d:x;
    return;
}
int n,m,st[N+1],a[N+1][M+1],dp[2][1<<M][2],cnt[M+1],sz[1<<M];
int main()
{
    int op=0;
    n=read(),m=read();
    for (int i=0;i<(1<<m);++i) dp[0][i][0]=dp[0][i][1]=-inf;
    for (int i=1;i<=n;++i)
    {
	for (int j=1;j<=m;++j) a[i][j]=read(),st[i]|=(a[i][j]<<(j-1)),cnt[j]+=a[i][j];
	sz[st[i]]++,dp[0][st[i]][0]=0;
    }
    for (int i=1;i<=m;++i)
    {
	op^=1;
	for (int j=0;j<(1<<m);++j) dp[op][j][0]=dp[op][j][1]=-inf;
	for (int j=0;j<(1<<m);++j)
	    if (j&(1<<(i-1)))
	    {
		for (int opt=0;opt<=1;++opt)
		{
		    Adder(dp[op][j^(1<<(i-1))][opt],dp[op^1][j^(1<<(i-1))][opt]+(cnt[i]>=(n>>1)));
		    Adder(dp[op][j^(1<<(i-1))][1],dp[op^1][j][opt]+(cnt[i]-1>=(n>>1)));
		    Adder(dp[op][j][1],dp[op^1][j^(1<<(i-1))][opt]+(cnt[i]-1>=(n>>1)));
		    Adder(dp[op][j][opt],dp[op^1][j][opt]+(cnt[i]-2>=(n>>1)));
		}
	    }
    }
    for (int i=1;i<=n;++i)
    {
	if (sz[st[i]]==1) printf("%d\n",dp[op][st[i]][1]);
	else printf("%d\n",max(dp[op][st[i]][0],dp[op][st[i]][1]));
    }
    return 0;
}