#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(int Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(int Ti=(Ta);Ti>=(Tb);--Ti)
#define Debug(...) fprintf(stderr,__VA_ARGS__)
using ll=long long;
const int N=3e5+5,M=21;
int n,m,a[N][M],val[N],cnt[M];
struct Info{
	int mn,se;
}f[M][1<<M];
Info operator+(const Info &i1,const Info &i2){
	int mn=1e9,se=1e9;
	for(int x:{i1.mn,i1.se,i2.mn,i2.se}){
		if(x<mn) se=mn,mn=x;
		else if(x<se) se=x;
	}
	return {mn,se};
}
Info operator+(const Info &i,int x){
	return {i.mn+x,i.se+x};
}
int main(){
	ios::sync_with_stdio(false),cin.tie(nullptr);
	cin>>n>>m;
	For(i,1,n) For(j,1,m){
		cin>>a[i][j],cnt[j]+=a[i][j];
		val[i]|=a[i][j]*(1<<(j-1));
	}
	memset(f,0x3f,sizeof(f));
	For(i,1,n){
		if(f[0][val[i]].mn) f[0][val[i]].mn=0;
		else f[0][val[i]].se=0;
	}
	For(i,1,m) For(S,0,(1<<m)-1){
		if(S>>(i-1)&1) f[i][S]=f[i-1][S]+1+f[i-1][S^(1<<(i-1))];
		else f[i][S]=f[i-1][S]+f[i-1][S^(1<<(i-1))];
	}
	For(i,1,n){
		For(j,1,m) cnt[j]-=a[i][j];
		int ans=0,S=0;
		For(j,1,m){
			if(cnt[j]>=n/2) ++ans;
			if(cnt[j]==n/2) S|=1<<(j-1);
		}
		cout<<ans-(f[m][S].mn==__builtin_popcount(val[i]&S)?f[m][S].se:f[m][S].mn)<<'\n';
		For(j,1,m) cnt[j]+=a[i][j];
	}
	return 0;
}