#include<bits/stdc++.h>

#define ll long long
#define vc vector
#define pb push_back
#define mem(a) memset(a,0,sizeof(a))
#define memu(a) memset(a,0x3f,sizeof(a))
#define memd(a) memset(a,-0x3f,sizeof(a))

using namespace std;
const int N=1<<21,P=998244353;
const int inf=0x3f3f3f3f;

//in&out
inline int read() {
    int x=0,w=0; char ch=getchar(); while(!isdigit(ch)) w|=(ch=='-'), ch=getchar();
    while(isdigit(ch)) x=x*10+(ch^48), ch=getchar(); return w?-x:x;

}
inline void write(int x) { if(x<0) putchar('-'), x=-x; if(x>9) write(x/10); putchar(x%10+'0'); }
inline void writee(int x) { write(x); putchar(10); }
inline void writec(int x) { write(x); putchar(32); }

//calc
inline void inc(int &x,int y) { x+=y-P; x+=(x>>31)&P; }
inline void dec(int &x,int y) { x-=y;   x+=(x>>31)&P; }
inline int pls(int x,int y) { return x+=y-P, x+=(x>>31)&P, x; }
inline void Min(int &x,int y) { if(x>y) x=y; }
inline void Max(int &x,int y) { if(x<y) x=y; }

int n,m,all,lim,a[N][21],s[N],sum[N];
int f[N],g[N];

int tmp[N],cnt;
inline int pop_count(int x,int statu) {
    if(x<0) return -1; int mask=s[x]&statu,res=0;
    for(int i=0;i<m;i++) res+=(mask>>i)&1;
    return res; 
}
inline void upd(int x,int y) {
    cnt=0; tmp[++cnt]=f[x]; tmp[++cnt]=g[x]; tmp[++cnt]=f[y]; tmp[++cnt]=g[y];
    sort(tmp+1,tmp+1+cnt,[&](int A,int B) { return pop_count(A,x)>pop_count(B,x); });
    cnt=unique(tmp+1,tmp+1+cnt)-tmp-1; tmp[++cnt]=-1; tmp[++cnt]=-1;
    f[x]=tmp[1]; g[x]=tmp[2];
}

int main() {
    n=read(); m=read(); all=(1<<m)-1; lim=n>>1;
    memset(f,-1,sizeof(f));
    memset(g,-1,sizeof(g));
    for(int i=1;i<=n;i++) {
        s[i];
        for(int j=1;j<=m;j++) a[i][j]=read(), s[i]|=(!a[i][j])<<j-1, sum[j]+=a[i][j];
        if(f[s[i]]<0) f[s[i]]=i;
        else if(g[s[i]]<0) g[s[i]]=i;
    }
    for(int i=0;i<m;i++)
        for(int j=all;j>=0;j--)
            if(!(j&(1<<i))) {
                if(f[j]>=f[j^(1<<i)]) Max(g[j],f[j^(1<<i)]);
                else Max(g[j]=f[j],g[j^(1<<i)]), f[j]=f[j^(1<<i)];
            }
    for(int i=0;i<m;i++)
        for(int j=0;j<=all;j++)
            if(j&(1<<i)) upd(j,j^(1<<i));
    for(int i=1;i<=n;i++) {
        int mask=0,res=0,ad=0;
        for(int j=1;j<=m;j++) {
            mask|=(sum[j]-a[i][j]==lim)<<j-1;
            res+=(sum[j]-a[i][j])>lim;
        }
        if(f[mask]!=i) ad=max(ad,pop_count(f[mask],mask));
        if(g[mask]!=i) ad=max(ad,pop_count(g[mask],mask));
        writee(res+ad);
    }
    return 0;
}