#include <bits/stdc++.h>

using namespace std;

constexpr int N = 3e5 + 10, M = 20;

int n, m, a[N][M + 1], c[M + 1], T[N], f[1 << M][2];
int S0, S1, cnt;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(nullptr), cout.tie(nullptr);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < m; j++) cin >> a[i][j], T[i] = (T[i] << 1) ^ a[i][j] ^ 1, c[j] += a[i][j];
        f[T[i]][0] ? f[T[i]][1] = i : f[T[i]][0] = i;
    }
    for (int i = 0; i < m; i++) {
        if (c[m - i - 1] == n / 2) S0 ^= (1 << i);
        else if (c[m - i - 1] == n / 2 + 1) S1 ^= (1 << i);
        else cnt += (c[m - i - 1] > n / 2);
    }
    
    for (int i = 0; i < m; i++) {
        for (int S = 0; S < (1 << m); S++) {
            if (!(S & (1 << i))) {
                int *from = f[S ^ (1 << i)], *to = f[S];
                if (!to[0]) to[0] = from[0], to[1] = from[1];
                else if (!to[1]) to[1] = from[0] == to[0] ? from[1] : from[0];
            }
        }
    }
    
    vector<int> w;
    for (int i = 0; i < m; i++) {
        for (int S = 0; S < (1 << m); S++) {
            if (S & (1 << i)) {
                w.clear();
                int *from = f[S ^ (1 << i)], *to = f[S];
                for (int i : {0, 1}) w.emplace_back(to[i]), w.emplace_back(from[i]);
                sort(w.begin(), w.end(), [&](int a, int b) {return __builtin_popcount(S & T[a]) > __builtin_popcount(S & T[b]);});
                w.erase(unique(w.begin(), w.end()), w.end());
                to[0] = w[0]; if (w.size() > 1) to[1] = w[1];
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        int S = (S0 & T[i]) | (S1 & (~T[i]));
        cout << cnt + __builtin_popcount(S1 & T[i]) + __builtin_popcount(S & T[f[S][0] == i ? f[S][1] : f[S][0]]) << '\n';
    }
    return 0;
}