#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}
 
#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 300005
#define inf 0x3f3f3f3f

int n,m;
int a[maxn][22],b[maxn];
int cnt[maxn];

struct node{
	pii x,y;
	void ins(pii z){
		if(z.se==x.se || z.se==y.se)return;
		if(z>x)y=x,x=z;
		else if(z>y)y=z;
	}
}mx[1<<20],hav[1<<20];

signed main()
{
	n=read(),m=read();
	For(i,1,n){
		int S=0;
		For(j,0,m-1)a[i][j]=read(),cnt[j]+=a[i][j],S|=((!a[i][j])<<j);
		hav[S].ins(mkp(1,i));
		b[i]=S;
	}
	For(i,0,m-1)For(s,0,(1<<m)-1)if(s>>i&1)
		hav[s^(1<<i)].ins(hav[s].x),hav[s^(1<<i)].ins(hav[s].y);
	For(i,0,(1<<m)-1)
		{
			int c=__builtin_popcount(i);
			if(hav[i].x.se) mx[i].ins(mkp(c,hav[i].x.se));
			if(hav[i].y.se) mx[i].ins(mkp(c,hav[i].y.se)); 
		}
	For(i,0,m-1)
		For(s,0,(1<<m)-1)	
			if(s>>i&1)
				mx[s].ins(mx[s^(1<<i)].x),
				mx[s].ins(mx[s^(1<<i)].y);
	For(i,1,n){
		int res=0,nd=0;
		For(j,0,m-1){
			cnt[j]-=a[i][j];
			if(cnt[j]-1>=n/2)++res;
			else if(cnt[j]>=n/2)nd|=(1<<j);
		}
		if(i==mx[nd].x.se)res+=mx[nd].y.fi;
		else res+=mx[nd].x.fi;
		if(i==3){
			
		}
		cout<<res<<"\n";
		For(j,0,m-1)cnt[j]+=a[i][j];
	}
	return 0;
}