#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class A, class B>
bool maximize(A &a, const B b) {
if (a < b) {
a = b;
return true;
} return false;
}
template <class A, class B>
bool minimize(A &a, const B b) {
if(a > b) {
a = b;
return true;
} return false;
}
using pII = pair <int, int>;
using vI = vector <int>;
using vL = vector <long long>;
using pLI = pair <long long, int>;
#define BIT(mask, i) ((mask >> (i)) & 1)
#define MASK(a) (1LL<<(a))
#define FOR(i, a, b) for(int i = a; i <= (int)b; i++)
#define FORD(i, a, b) for(int i = a; i >= (int)b; i--)
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
const int mod = 1e9 + 7;
const int maxn = 4e5 + 5;
int n, m;
int a[maxn][22];
pair <int, int> dp[MASK(20) + 1];
namespace sub1 {
int sum[22];
void solve() {
FOR(i, 1, n) FOR(j, 1, m) sum[j]+= a[i][j];
FOR(i, 1, n) {
FOR(j, 1, m) sum[j]-= a[i][j];
int cnt = 0, mask = 0;
FOR(j, 1, m) {
if(sum[j] > n / 2) {
cnt++;
} else if(sum[j] == n / 2) {
mask |= MASK(j - 1);
}
}
int sonmask = mask, ans = cnt;
while(sonmask) {
int rev_mask = (MASK(m) - 1) ^ sonmask;
if(dp[rev_mask].first != i || dp[rev_mask].second != i) {
maximize(ans, cnt + __builtin_popcount(sonmask));
}
sonmask = (sonmask - 1) & mask;
}
cout << ans << "\n";
FOR(j, 1, m) sum[j]+= a[i][j];
}
}
}
void process() {
cin >> n >> m;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
for(int i = 1; i <= m; i++) {
int mask = 0;
for(int j = 1; j <= m; j++) if(a[i][j]) {
mask |= MASK(j - 1);
}
if(dp[mask].first == 0) {
dp[mask].first = i;
} else dp[mask].second = i;
}
for(int i = 0; i < m; i++) {
for(int mask = 0; mask < MASK(m); mask++) {
if(BIT(mask, i)) {
// dp[mask]+= dp[mask ^ (1 << i)];
if(dp[mask].first == 0) {
dp[mask] = dp[mask ^ (1 << i)];
} else {
if(dp[mask ^ (1 << i)].first != dp[mask].first) {
dp[mask].second = dp[mask ^ (1 << i)].first;
}
if(dp[mask ^ (1 << i)].second != dp[mask].first) {
dp[mask].second = dp[mask ^ (1 << i)].second;
}
}
}
}
}
sub1::solve();
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#define taskname "kieuoanh"
if(fopen(taskname".inp", "r")) {
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
int tc = 1; /// cin >> tc;
while(tc--) process();
return 0;
}
