#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define PB push_back
#define fi first
#define se second
using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;
using namespace std;const int N=3e5+5,M=(1<<20)+5,K=3e7+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=2e18;mt19937 rnd(time(0));
int n,m,k,x,y,z,A[N],B[N];
struct Node{int w,id;};bool cmp(Node x,Node y){return x.w>y.w;}
struct Pa{
    Node x,y;Pa(){x.w=x.id=y.w=y.id=-1;}
    Pa operator +(const Pa &B)const{
        Node D[4]={x,B.x,y,B.y};sort(D,D+4,cmp);
        Pa C;C.x=D[0];for(int i=1;i<4;i++) if(D[i].id^D[0].id) {C.y=D[i];break;};return C;
    }
}f[M],g[M],Ts;
int main(){
    // freopen("1.in","r",stdin);
    int i,j;scanf("%d%d",&n,&m);for(i=1;i<=n;i++) {
        for(j=0;j<m;j++) scanf("%d",&x),A[i]|=x<<j,B[j]+=x;
    }
    for(i=1;i<=n;i++) Ts.x=(Node){0,i},f[((1<<m)-1)^A[i]]=f[((1<<m)-1)^A[i]]+Ts;
    for(i=0;i<m;i++) for(j=0;j<(1<<m);j++) if(j>>i&1) f[j^(1<<i)]=f[j^(1<<i)]+f[j];
    for(i=0;i<(1<<m);i++) ~f[i].x.w&&(f[i].x.w=__builtin_popcount(i)),~f[i].y.w&&(f[i].y.w=__builtin_popcount(i));
    // for(i=0;i<m;i++) cerr<<f[i].x.w<<' '<<f[i].x.id<<'\n';
    for(i=0;i<m;i++) for(j=0;j<(1<<m);j++) if(j>>i&1) f[j]=f[j^(1<<i)]+f[j];
    // cerr<<f[4].x.w<<'\n';
    for(i=1;i<=n;i++){
        for(j=0;j<m;j++) B[j]-=A[i]>>j&1;
        int ToT=0,x=0;for(j=0;j<m;j++) if(B[j]>n/2) ToT++;else if(B[j]==n/2) x|=1<<j;
        if(f[x].x.id^i) ToT+=max(f[x].x.w,0);else ToT+=max(f[x].y.w,0);
        printf("%d\n",ToT);
        for(j=0;j<m;j++) B[j]+=A[i]>>j&1;
    }
}