#include<bits/stdc++.h>
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=2e6+5,lg=20,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
int node,k,a[N],dem[lg+5],cnt[N],dp[N][lg];
bool M2;
void solve(){
cin >> node >> k;
for(int i=1;i<=node;++i){
for(int j=0;j<k;++j){
int x;
cin >> x;
a[i]|=(x<<j);
dem[j]+=x;
}
cnt[a[i]]++;
}
for(int i=0;i<k;++i){
for(int mask=0;mask<(1<<k);++mask){
if(mask>>i&1)cnt[(1<<i)^mask]+=cnt[mask];
}
}
// for(int mask=0;mask<(1<<k);++mask){
// cout <<cnt[mask]<<" ";
// }
for(int i=0;i<(1<<k);++i){
dp[i][__builtin_popcount(i)]=cnt[i];
}
int moc=node/2;
for(int i=0;i<k;++i){
for(int mask=0;mask<(1<<k);++mask){
if(mask>>i&1)continue;
for(int sl=0;sl<k;++sl){
dp[mask^(1<<i)][sl]+=dp[mask][sl]-dp[mask^(1<<i)][sl+1];
}
}
}
for(int i=1;i<=node;++i){
int ans=0,vot=0;
for(int j=0;j<k;++j){
if(dem[j]-(a[i]>>j&1)>moc)++ans;
if(dem[j]-(a[i]>>j&1)==moc)vot|=(1<<j);
}
for(int j=0;j<=k;++j){
if(dp[vot][j]-(__builtin_popcount(vot&a[i])==j)){
ans+=__builtin_popcount(vot)-j;
break;
}
}
cout <<ans<<'\n';
}
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#define task "aws"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();
}
look_memory;
look_time;
}
