#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define INF 1000000001LL
#define POT (1LL<<23)
#define INFL 1000000000000000099LL
#define pii pair<ll,ll>
#define ppi pair<pii,ll>
#define pip pair<ll,pii>
#define ppp pair<pii,pii>
#define vi vector<ll>
#define vii vector<pii>
#define vvi vector<vi>
#define al(x) x.begin(),x.end()
#define rev(x) reverse(al(x))
#define X 18
#define FCTCST 7
template<typename T, typename U>
pair<T, U> operator+(const pair<T, U>& a, const pair<T, U>& b) {
return {a.first + b.first, a.second + b.second};
}
template<typename T, typename U>
pair<T, U> operator-(const pair<T, U>& a, const pair<T, U>& b) {
return {a.first - b.first, a.second - b.second};
}
template<typename T, typename U,typename Z>
pair<T, U> operator*(const pair<T, U>& a, const Z& b) {
return {a.first*b, a.second*b};
}
template<typename T, typename U,typename Z>
pair<T, U> operator/(const pair<T, U>& a, const Z& b) {
return {a.first/b, a.second/b};
}
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os<<"{"<<p.ff<<", "<<p.ss<<"}";
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
for (size_t i = 0; i < v.size(); ++i) {
if (i) os << ", ";
os << v[i];
}
os << "}";
return os;
}
template<ll MOD=998244353>
struct mint_t{
ll x;
mint_t(ll y=0){x=y%MOD;if(x<0)x+=MOD;}
mint_t& operator+=(const mint_t& a){if((x+=a.x)>=MOD)x-=MOD;return *this;}
mint_t& operator-=(const mint_t& a){if((x+=MOD-a.x)>=MOD)x-=MOD;return *this;}
mint_t operator+(const mint_t& a)const{mint_t res(*this);return res+=a;}
mint_t operator-(const mint_t& a)const{mint_t res(*this);return res-=a;}
mint_t& operator*=(const mint_t& a){(x*=a.x)%=MOD;return *this;}
mint_t operator*(const mint_t& a)const{mint_t res(*this);return res*=a;}
mint_t fp(ll y)const{
mint_t a=1,b=x;
while(y){
if(y&1)a*=b;
b*=b;
y/=2;
}
return a;
}
mint_t& operator/=(const mint_t& a){(*this)*=a.fp(MOD-2);return *this;}
mint_t operator/(const mint_t& a)const{mint_t res(*this);return res/=a;}
};
#define mint mint_t<>
template<long long MOD>
istream& operator>>(istream& in, mint_t<MOD>& a){
ll x;
in>>x;
a=mint_t<MOD>(x);
return in;
}
template<long long MOD>
istream& operator<<(istream& out, mint_t<MOD>& a){
out<<a.x;
return out;
}
mint fct[FCTCST];
mint bnm(ll a,ll b){
if(b>a || a<0)return 0;
return fct[a]/fct[b]/fct[a-b];
}
ll pc(ll x){
return __builtin_popcountll(x);
}
pii bs[(1<<20)];
vi v;
pii mn(pii a,pii b,ll x){
vii ve;
ve.pb({pc(v[a.ff]&x),a.ff});
ve.pb({pc(v[a.ss]&x),a.ss});
ve.pb({pc(v[b.ff]&x),b.ff});
if(b.ss!=-1)
ve.pb({pc(v[b.ss]&x),b.ss});
sort(al(ve));
ve.erase(unique(al(ve)),ve.end());
rev(ve);
return {ve[0].ss,ve[1].ss};
}
ll il[20];
ll n,m,a,b;
void solve(){
cin>>n>>m;
for(ll i=0;i<(1<<m);i++)bs[i]={0,1};
for(ll i=0;i<n;i++){
v.pb(0);
for(ll j=0;j<m;j++){
cin>>a;v.back()=v.back()*2+1-a;il[j]+=a;
}
bs[v.back()]=mn(bs[v.back()],{i,-1},v.back());
}
for(ll i=0;i<(1<<m);i++){
for(ll j=0;j<m;j++){
bs[i]=mn(bs[i],bs[i^(1<<j)],i);
}
}
for(ll i=(1<<m)-1;i+1;i--){
for(ll j=0;j<m;j++){
bs[i]=mn(bs[i],bs[i^(1<<j)],i);
}
}
for(ll i=1;i<=n;i++){
ll msk=0;
ll w=0;
for(ll j=0;j<m;j++){
if((il[m-1-j]-((bool)((~v[i-1])&(1<<j))))==n/2){
msk^=(1<<j);
}
else if((il[m-1-j]-((bool)((~v[i-1])&(1<<j))))>n/2)w++;
}
if(bs[msk].ff==i-1)cout<<w+pc(msk&v[bs[msk].ss])<<"\n";
else cout<<w+pc(msk&v[bs[msk].ff])<<"\n";
}
}
int main(){
fct[0]=1;
for(ll i=1;i<FCTCST;i++)fct[i]=fct[i-1]*i;
ll t=1;
//cin>>t;
for(ll i=1;i<=t;i++){
//cout<<"Case #"<<i<<": ";
solve();
}
}
