#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[300005][24];
int sum_col[25], rmask[300005], cnt_mask[MASK(20) + 1];
namespace sub12 {
bool checksub() {
return n <= 3000;
}
int sum_col[3005];
void solve() {
FOR(i, 1, n) FOR(j, 1, m) sum_col[j]+= a[i][j];
int lim = (n / 2);
FOR(i, 1, n) {
FOR(j, 1, m) sum_col[j]-= a[i][j];
int ans = 0;
FOR(j, 1, n) if(i != j) {
int cnt = 0;
FOR(k, 1, m) {
sum_col[k]-= a[j][k];
if(sum_col[k] >= lim) cnt++;
sum_col[k]+= a[j][k];
}
maximize(ans, cnt);
}
cout << ans << "\n";
FOR(j, 1, m) sum_col[j]+= a[i][j];
}
}
}
namespace sub3 {
int ans_for_mask[MASK(20) + 2];
void solve() {
vector <int> values;
FOR(i, 1, n) values.push_back(rmask[i]);
sort(all(values));
values.resize(unique(all(values)) - values.begin());
int one = 0, zero = 0, two = 0, lim = n / 2;
FOR(i, 1, m) {
if(sum_col[i] >= lim + 2) two |= MASK(i - 1);
if(sum_col[i] == lim + 1) one |= MASK(i - 1);
if(sum_col[i] == lim) zero |= MASK(i - 1);
}
for(auto ai : values) {
for(auto aj : values) if(aj != ai || cnt_mask[ai] >= 2) {
int resmask = two | (one & ~ (ai & aj)) | (zero & ~ (ai | aj));
maximize(ans_for_mask[ai], __builtin_popcount(resmask));
}
}
FOR(i, 1, n) cout << ans_for_mask[rmask[i]] << "\n";
}
}
namespace sub4 {
void solve() {
}
}
void process() {
cin >> n >> m;
FOR(i, 1, n) FOR(j, 1, m) cin >> a[i][j];
FOR(i, 1, n) {
FOR(j, 1, m) sum_col[j]+= a[i][j];
FOR(j, 1, m) if(a[i][j]) rmask[i] |= MASK(j - 1);
cnt_mask[rmask[i]]++;
}
if(sub12::checksub()) return sub12::solve();
return sub3::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;
}
