#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
pii dp1[(1<<20)];
pair<pll,pll> dp2[(1<<20)];
int cnt[20];
int vote[300001];
pair<pll,pll> add2(pair<pll,pll> a, pll b)
{
if(b.ss == a.ff.ss)
{
a.ff = max(a.ff,b);
}
else if(b.ss == a.ss.ss)
{
a.ss = max(a.ss,b);
if(a.ss > a.ff) swap(a.ff,a.ss);
}
else if(a.ff < b)
{
swap(a.ff,a.ss);
a.ff = b;
}
else if(a.ss < b)
{
a.ss = b;
}
return a;
}
pair<pll,pll> merge(pair<pll,pll> a, pair<pll,pll> b)
{
a = add2(a,b.ff);
a = add2(a,b.ss);
return a;
}
pii add(pii x, int a)
{
if(x.ff == -1)
{
x.ff = a;
return x;
}
if(x.ss == -1)
{
x.ss = a;
return x;
}
return x;
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n,m;
cin >> n >> m;
rep(i,(1<<m)) dp1[i] = {-1,-1};
rep(i,n)
{
rep(j,m)
{
char z;
cin >> z;
if(z == '1')
{
cnt[j]++;
vote[i] += (1<<j);
}
}
dp1[vote[i]] = add(dp1[vote[i]],i);
}
rep(j,m)
{
rep(i,(1<<m))
{
if(i&(1<<j))
{
dp1[i] = add(dp1[i],dp1[i-(1<<j)].ff);
dp1[i] = add(dp1[i],dp1[i-(1<<j)].ss);
}
}
}
rep(i,(1<<m))
{
int m2 = (i^((1<<m)-1));
if(dp1[m2].ff != -1) dp2[i].ff = {count_bits(i),dp1[m2].ff};
else dp2[i].ff = {0,-1};
if(dp1[m2].ss != -1) dp2[i].ss = {count_bits(i),dp1[m2].ss};
else dp2[i].ss = {0,-1};
}
rep(j,m)
{
rep(i,(1<<m))
{
if(i&(1<<j)) dp2[i] = merge(dp2[i],dp2[i-(1<<j)]);
}
}
rep(i,n)
{
int ans = 0;
int mask = 0;
rep(j,m)
{
if(cnt[j]-((vote[i]&(1<<j))==(1<<j)) > (n/2)) ans++;
if(cnt[j]-((vote[i]&(1<<j))==(1<<j)) == (n/2)) mask += (1<<j);
}
if(dp2[mask].ff.ss == i) ans += dp2[mask].ss.ff;
else ans += dp2[mask].ff.ff;
cout << ans << "\n";
}
}
