#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define all(arr) (arr).begin(), (arr).end()
#define ll long long
#define ld long double
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define endl '\n'

const int N = 3e5 + 20, M = 20;

int dp[2][1 << M], dpwho[2][1 << M], a[N], cnt[M];
pair<int, int> sosdp[1 << M];

signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  // cout.precision(20);
  for (int i = 0; i < (1 << M); i++) dp[0][i] = dp[1][i] = N, sosdp[i] = {-1, -1};
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++){
    for (int j = 0; j < m; j++){
      int x;
      cin >> x;
      a[i] ^= x << j;
      cnt[j] += x;
    }
    if (sosdp[a[i]].fi == -1) sosdp[a[i]].fi = i;
    else if (sosdp[a[i]].se == -1) sosdp[a[i]].se = i;
  }
  for (int i = 0; i < m; i++){
    for (int mask = (1 << m) - 1; mask >= 0; mask--){
      if (mask >> i & 1){
        int nmask = mask ^ (1 << i);
        if (sosdp[mask].fi == -1) sosdp[mask] = sosdp[nmask];
        else if (sosdp[mask].se == -1) sosdp[mask].se = sosdp[nmask].fi;
      }
    }
  }
  for (int mask = 0; mask < (1 << m); mask++){
    if (sosdp[((1 << m) - 1) ^ mask].fi != -1){
      dp[0][mask] = 0, dpwho[0][mask] = sosdp[((1 << m) - 1) ^ mask].fi;
    }
    if (sosdp[((1 << m) - 1) ^ mask].se != -1){
      dp[1][mask] = 0, dpwho[1][mask] = sosdp[((1 << m) - 1) ^ mask].se;
    }
    for (int i = 0; i < m; i++){
      if (mask >> i & 1){
        int nmask = mask ^ (1 << i);

        int cur = dp[0][nmask] + 1, curwho = dpwho[0][nmask];
        
        if (curwho == dpwho[0][mask]) dp[0][mask] = min(dp[0][mask], cur);
        else if (curwho == dpwho[1][mask]){
          dp[1][mask] = min(dp[1][mask], cur);
          if (dp[0][mask] > dp[1][mask]) swap(dp[0][mask], dp[1][mask]), swap(dpwho[0][mask], dpwho[1][mask]);
        }
        else if (cur < dp[0][mask]){
          dp[1][mask] = dp[0][mask], dpwho[1][mask] = dpwho[0][mask];
          dp[0][mask] = cur, dpwho[0][mask] = curwho;
        }
        else if (cur < dp[1][mask]) dp[1][mask] = cur, dpwho[1][mask] = curwho;

        cur = dp[1][nmask] + 1, curwho = dpwho[1][nmask];

        if (curwho == dpwho[0][mask]) dp[0][mask] = min(dp[0][mask], cur);
        else if (curwho == dpwho[1][mask]){
          dp[1][mask] = min(dp[1][mask], cur);
          if (dp[0][mask] > dp[1][mask]) swap(dp[0][mask], dp[1][mask]), swap(dpwho[0][mask], dpwho[1][mask]);
        }
        else if (cur < dp[0][mask]){
          dp[1][mask] = dp[0][mask], dpwho[1][mask] = dpwho[0][mask];
          dp[0][mask] = cur, dpwho[0][mask] = curwho;
        }
        else if (cur < dp[1][mask]) dp[1][mask] = cur, dpwho[1][mask] = curwho;
      }
    }
  }
  for (int i = 0; i < n; i++){
    for (int j = 0; j < m; j++) cnt[j] -= a[i] >> j & 1;
    int ans = 0, mask = 0;
    for (int j = 0; j < m; j++){
      if (cnt[j] >= n / 2) ans++;
      if (cnt[j] == n / 2) mask ^= 1 << j;
    }
    ans -= (dpwho[0][mask] == i? dp[1][mask] : dp[0][mask]);
    cout << ans << endl;
    for (int j = 0; j < m; j++) cnt[j] += a[i] >> j & 1;
  }
}