#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
const int  N = 3e5 + 12, MOD = (int)1e9 + 7;

int n, m, x[N], c[N], a[N][20];
vector<int> g[(1 << 20) + 1];
vector<pair<int, int>> b;
void test() {
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> a[i][j];
            if(a[i][j]) {
                x[i] |= (1 << j);
                c[j]++;
            }
        }
        g[x[i]].push_back(i);
        b.push_back({__builtin_popcount(x[i]), i});
    }
    sort(b.begin(), b.end());
    vector<int> f;
    while(!b.empty() && b.back().first != b[0].first) {
        f.push_back(b.back().second);
        b.pop_back();
    }
    reverse(f.begin(), f.end());
    for(int i = 0; i < min((int)f.size(),  2); i++) {
        b.push_back({0, f[i]});
    }
    // cout << (int)b.size() << '\n';
    int val = n / 2;
    for(int i = 1; i <= n; i++) {   
        int res = 0, t = 0;
        for(int j = 0; j < m; j++) {
            if(c[j] - a[i][j] > val) {
                res++;
            } else if(c[j] - a[i][j] == val) {
                t |= (1 << j);
                res++;
            }
        }
        int mn = __builtin_popcount(t);
        // cout << res << ' ' << mn << '\n';
        for(auto [j, y]:b) {
            if(y == i) continue;
            int _t = (t & x[y]);
            mn = min(mn, __builtin_popcount(_t));
            // cout << mn << '\n';
        }
        cout << res - mn << '\n';
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 

    int t = 1; 
    // cin >> t;
    
    while(t--) 
        test();
    return 0;
}