#include <bits/stdc++.h>
#define N 300005
#define M 23
using namespace std;
typedef long long ll;

struct Pr { int fi, se; } mx[(1<<(M-3))+5];

int n, m, st[N], cnt[M], mp[N][M];
int num[(1<<(M-3))+5], ppcnt[(1<<(M-3))+5];
ll C[M][M], cal[(1<<(M-3))+5][M], nw[M];
int tmp[4];

void chkmax (Pr &a, Pr b)
{
    tmp[0]=a.fi; tmp[1]=a.se; tmp[2]=b.fi; tmp[3]=b.se;
    sort(tmp, tmp+4);
    a.fi=tmp[3];
    for (int i=2; i>=0; i--) if (tmp[i]!=a.fi) { a.se=tmp[i]; break; }
}

int main ()
{
    // freopen("0test.in", "r", stdin);
    // freopen("0test.out", "w", stdout);

    scanf("%d %d", &n, &m);
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=m; j++) {
            scanf("%d", &mp[i][j]);
            st[i]+=mp[i][j]*(1<<(j-1));
            cnt[j]+=mp[i][j];
        }
        st[i]=(st[i]^((1<<m)-1));
        num[st[i]]++;
    }

    C[0][0]=1;
    for (int i=1; i<=m; i++) {
        C[i][0]=1;
        for (int j=1; j<=i; j++) { C[i][j]=C[i-1][j-1]+C[i-1][j]; }
    }

    for (int i=0; i<m; i++) {
        for (int p=0; p<(1<<m); p++) if ((p>>i)&1) {
            num[p^(1<<i)]+=num[p];
        }
    }
    for (int p=0; p<(1<<m); p++) { ppcnt[p]=ppcnt[p>>1]+(p&1); cal[p][ppcnt[p]]=num[p]; }
    for (int i=0; i<m; i++) {
        for (int p=0; p<(1<<m); p++) if ((p>>i)&1) {
            for (int j=0; j<=ppcnt[p]-1; j++) {
                cal[p][j]+=cal[p^(1<<i)][j];
            }
        }
    }

    for (int i=1; i<=n; i++) {
        int res=0, cur=0;
        for (int j=1; j<=m; j++) {
            if (cnt[j]-mp[i][j]==(n/2)) { cur+=(1<<(j-1)); }
            else if (cnt[j]-mp[i][j]>(n/2)) { res++; }
        }
        for (int j=0; j<=m; j++) { nw[j]=cal[cur][j]; }
        for (int j=ppcnt[cur]; j>=0; j--) {
            for (int k=ppcnt[cur]; k>j; k--) { nw[j]-=C[k][j]*nw[k]; }
            if (nw[j]-(ppcnt[st[i]&cur]==j)) { res+=j; break; }
        }
        printf("%d\n", res);
    }

    return 0;
}