#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];
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]++;
            }
        }
    }
    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);
        for(int k = 1; k <= n; ++k) {
            int _t = (t & x[k]);
            if(k == i) continue;
            mn = min(mn, __builtin_popcount(_t));
        }
        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;
}