#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
}
struct set1 {
  int x, y;
  void insert(int v) {
    if (!x) {
      x = v;
    } else if (x != v) {
      y = v;
    }
  }
  set1 &operator+=(const set1 &o) {
    if (o.x) {
      insert(o.x);
      if (o.y) insert(o.y);
    }
    return *this;
  }
};
struct set2 {
  pair<int, int> x, y;
  void insert(const pair<int, int> &v) {
    if (!x.second) {
      x = v;
    } else if (x.second == v.second) {
      chkmax(x.first, v.first);
    } else if (!y.second) {
      y = v;
      if (x.first < y.first) swap(x, y);
    } else if (y.second == v.second) {
      chkmax(y.first, v.first);
      if (x.first < y.first) swap(x, y);
    } else if (v.first > x.first) {
      y = x;
      x = v;
    } else if (v.first > y.first) {
      y = v;
    }
  }
  set2 &operator+=(const set2 &o) {
    if (o.x.second) {
      insert(o.x);
      if (o.y.second) insert(o.y);
    }
    return *this;
  }
};
template <typename T>
void fmt_or(T f[], int len) {
  for (int i = 1; i < len; i <<= 1) {
    for (int j = 0; j < len; j += i << 1)
      for (int k = j; k < j + i; ++k) f[k + i] += f[k];
  }
}
template <typename T>
void fmt_and(T f[], int len) {
  for (int i = 1; i < len; i <<= 1) {
    for (int j = 0; j < len; j += i << 1)
      for (int k = j; k < j + i; ++k) f[k] += f[k + i];
  }
}
constexpr int MAXN = 3e5 + 10, MAXM = 20;
int n, m, sum[MAXM], lim;
bool a[MAXN][MAXM];
set1 f[1 << MAXM];
set2 g[1 << MAXM];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    int msk = 0;
    for (int j = 0; j < m; ++j) {
      cin >> a[i][j];
      sum[j] += a[i][j];
      if (!a[i][j]) msk |= 1 << j;
    }
    f[msk].insert(i);
  }
  lim = n / 2;
  fmt_and(f, 1 << m);
  for (int i = 0; i < 1 << m; ++i) {
    int tmp = __builtin_popcount(i);
    if (f[i].x) {
      g[i].insert({tmp, f[i].x});
      if (f[i].y) g[i].insert({tmp, f[i].y});
    }
  }
  fmt_or(g, 1 << m);
  for (int i = 1; i <= n; ++i) {
    int ans = 0, msk = 0;
    for (int j = 0; j < m; ++j) {
      int tmp = sum[j] - a[i][j];
      if (tmp > lim) {
        ++ans;
      } else if (tmp == lim) {
        msk |= 1 << j;
      }
    }
    assert(g[msk].y.second);
    if (g[msk].x.second == i) {
      ans += g[msk].y.first;
    } else {
      ans += g[msk].x.first;
    }
    cout << ans << "\n";
  }
  return 0;
}
// g++ council.cpp -o council -Wall -Wextra -Wshadow -O2 -std=c++14 -fsanitize=address,undefined