#include<bits/stdc++.h>
#define ll long long
#define pcnt __builtin_popcount
using namespace std;
const int MAXN=3e5+5;
int a[MAXN][25],cnt[25],id[25],e[MAXN],r[MAXN];
vector <int> f[1<<20];
signed main() {
	ios::sync_with_stdio(false);
	int n,m,s=0,A=0,ans=0;
	cin>>n>>m;
	for(int i=1;i<=n;++i) for(int j=1;j<=m;++j) {
		cin>>a[i][j],cnt[j]+=a[i][j];
	}
	fill(id+1,id+m+1,-1);
	for(int j=1;j<=m;++j) {
		if(cnt[j]==n/2) id[j]=s++,A|=1<<id[j];
		else if(cnt[j]==n/2+1) id[j]=s++;
		else if(cnt[j]>n/2+1) ++ans;
	}
	for(int i=1;i<=n;++i) {
		for(int j=1;j<=m;++j) if(~id[j]) e[i]|=a[i][j]<<id[j];
		r[i]=((1<<s)-1)^e[i];
		if(f[r[i]].size()<2) f[r[i]].push_back(i);
	}
	for(int k=1;k<(1<<s);k<<=1) for(int j=0;j<(1<<s);j+=k<<1) {
		for(int i=j;i<j+k;++i) {
			auto &Q=f[i];
			for(int z:f[i+k]) Q.push_back(z);
			sort(Q.begin(),Q.end());
			Q.erase(unique(Q.begin(),Q.end()),Q.end());
			if(Q.size()>2) Q.resize(2);
		}
	}
	for(int k=1;k<(1<<s);k<<=1) for(int j=0;j<(1<<s);j+=k<<1) {
		for(int i=j;i<j+k;++i) {
			auto &Q=f[i+k];
			for(int z:f[i]) Q.push_back(z);
			sort(Q.begin(),Q.end(),[&](int x,int y){
				return pcnt(r[x]&(i+k))>pcnt(r[y]&(i+k));
			});
			Q.erase(unique(Q.begin(),Q.end()),Q.end());
			if(Q.size()>2) Q.resize(2);
		}
	}
	for(int i=1;i<=n;++i) {
		int p=e[i]^A,z=(f[p][0]==i)?f[p][1]:f[p][0];
		cout<<ans+s-pcnt(e[i]&A)-pcnt(p)+pcnt(r[z]&p)<<"\n";
	}
	return 0;
}