#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
ll infl=1000000000000000007;
int inf=1000000007;
ll mod=1000000007;
ll mod1=998244353;

const int N=300007,M=20;

int ile[M];
vector<pair<int,int>>DP[(1<<M)];
int a[N];

void upd(int i)
{
    sort(all(DP[i]),greater<pair<int,int>>());
    vector<pair<int,int>>V;
    for(auto [x,y]:DP[i])
    {
        if(sz(V)==0) V.pb({x,y});
        else if(sz(V)==1&&y!=V[0].nd) V.pb({x,y});
    }
    DP[i]=V;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<m;j++)
        {
            int x;
            cin>>x;
            ile[j]+=x;
            a[i]^=x*(1<<j);
        }
        int x=(1<<m)-1-a[i];
        DP[x].pb({__builtin_popcount(x),i});
    }
    for(int i=0;i<(1<<m);i++) upd(i);
    for(int j=0;j<m;j++)
    {
        for(int i=0;i<(1<<m);i++)
        {
            for(auto [x,y]:DP[i])
            {
                if(i&(1<<j)) DP[i^(1<<j)].pb({x-1,y});
                else DP[i^(1<<j)].pb({x,y});
            }
            upd(i^(1<<j));
        }
    }
    for(int i=1;i<=n;i++)
    {
        int msk=0,cnt=0;
        for(int j=0;j<m;j++)
        {
            int t=ile[j];
            if(a[i]&(1<<j)) t--;
            if(t==n/2) msk^=(1<<j);
            else if(t>n/2) cnt++;
        }
        if(DP[msk][0].nd==i) cout<<cnt+DP[msk][1].st<<endl;
        else cout<<cnt+DP[msk][0].st<<endl;
    }

    return 0;
}