#include <bits/stdc++.h>

int32_t main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, m;
    std::cin >> n >> m;
    std::vector<int> input(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            char ch;
            std::cin >> ch;
            input[i] |= int(ch == '1') << j;
        }
    }

    std::vector<std::vector<int>> prf(n + 1, std::vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            prf[i + 1][j] = prf[i][j] + (input[i] >> j & 1);
        }
    }

    std::vector<int> ans(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) {
                continue;
            }
            int cnt = 0;
            for (int k = 0; k < m; k++) {
                int val = prf[n][k] - prf[0][k] - (prf[i + 1][k] - prf[i][k]) - (prf[j + 1][k] - prf[j][k]);
                cnt += n / 2 <= val;
            }
            ans[i] = std::max(ans[i], cnt);
        }
    }

    for (int i = 0; i < n; i++) {
        std::cout << ans[i] << " \n"[i == n - 1];
    }

    return 0;
}