#include <bits/stdc++.h>
using namespace std; 
const int MAXN = 6e5 + 5, MAXM = 2e6 + 5; 

int n, m; 
int a[MAXN], g1[MAXM], g2[MAXM], cnt[41]; 
inline void sum(void) {
    // 当前 S 没有被投的对应的编号 g
    for (int i = 0; i < m; ++i)
        for (int s = 0; s < 1 << m; ++s)
            if (!(s >> i & 1)) {
                int from = s | (1 << i);
                if (!g1[s]) {
                    g1[s] = g1[from];
                    if (g2[from] != g1[s])
                        if (!g2[s]) g2[s] = g2[from];
                } else {
                    if (g1[s] != g1[from])
                        if (!g2[s]) g2[s] = g1[from];
                }
            }
}
inline void maxx(void) {
    for (int i = 0; i < m; ++i)
        for (int s = 0; s < 1 << m; ++s)
            if (s >> i & 1) {
                int from = s ^ (1 << i);
                vector<int> v; 
                v.push_back(g1[s]), v.push_back(g2[s]); 
                v.push_back(g1[from]), v.push_back(g2[from]);
                #define bpc(x) __builtin_popcount(x)

                sort(v.begin(), v.end(), [&](int x, int y) { return bpc(a[x] & s) > bpc(a[y] & s); }); 
                v.erase(unique(v.begin(), v.end()), v.end());
                g1[s] = v[0];
                if (v.size() > 1) g2[s] = v[1];
            }
}

int main(void) {
    ios::sync_with_stdio(0); cin.tie(0); 
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            int x; cin >> x;
            if (x) ++cnt[m - j];
            a[i] <<= 1; a[i] |= x ^ 1; 
        }
        if (!g1[a[i]]) g1[a[i]] = i;
        else g2[a[i]] = i;
    }
    sum(); maxx();
    for (int i = 1; i <= n; ++i) {
        int num = 0, S = 0;
        for (int j = 0; j < m; ++j) {
            int c = cnt[j];
            if (!(a[i] >> j & 1)) --c; 
            if (c > n / 2) ++num; 
            if (c == n / 2) S |= 1 << j;
        }
        // 是半死不活的 S，且没被 a 投，能够活的
        if (i == g1[S]) num += bpc(a[g2[S]] & S); 
        else num += bpc(a[g1[S]] & S); 
        cout << num << "\n";
    }
    return 0;
}