#include <iostream>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 3e5 + 10, MAXM = (1 << 20) + 5;

int n, m, ans, res[MAXN], cnt[22];
bool a[MAXN][22], tp[22];
int id[22], tot, sta[MAXN], qry[MAXN];

bool f[MAXM];
int mx1[MAXM], h1[MAXM], mx2[MAXM], h2[MAXM];

int main()
{
    // freopen("B.in", "r", stdin);
    // freopen("B.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(m);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) Read(a[i][j]), cnt[j] += a[i][j];
    int lmt = n / 2;
    for (int j = 1; j <= m; j++)
        if (cnt[j] - 2 >= lmt) ans++;
        else if (cnt[j] >= lmt) ans++, id[++tot] = j, tp[tot] = (cnt[j] == lmt);
    // for (int i = 1; i <= tot; i++) cout << tp[i] << " "; cout << "\n";
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= tot; j++)
        {
            sta[i] |= (1 << j - 1) * a[i][id[j]];
            if (tp[j]) qry[i] |= (1 << j - 1) * (1 - a[i][id[j]]), res[i]++;
            else qry[i] |= (1 << j - 1) * a[i][id[j]], res[i] += a[i][id[j]];
        }
        // cout << sta[i] << " " << qry[i] << " " << res[i] << "\n";
        int tt = (1 << tot) - 1 - sta[i];
        // cout << tt << "\n";
        f[tt] = 1;
        if (!h1[tt]) h1[tt] = i;
        else if (!h2[tt]) h2[tt] = i;
    }
    // for (int s = 0; s < (1 << tot); s++) cout << g[s] << " "; cout << "\n";
    for (int s = (1 << tot) - 1; s >= 0; s--)
        for (int i = 1; i <= tot; i++)
            if (!(s & (1 << i - 1)))
            {
                f[s] |= f[s ^ (1 << i - 1)];
                if (!h1[s ^ (1 << i - 1)] || h2[s]) continue;
                if (!h1[s]) h1[s] = h1[s ^ (1 << i - 1)], h2[s] = h2[s ^ (1 << i - 1)];
                else if (h1[s] != h1[s ^ (1 << i - 1)]) h2[s] = h1[s ^ (1 << i - 1)];
                else if (h1[s] != h2[s ^ (1 << i - 1)]) h2[s] = h2[s ^ (1 << i - 1)];
            }
    // for (int s = 1; s < (1 << tot); s++) cout << f[s] << "\n";
    for (int s = 0; s < (1 << tot); s++)
        if (f[s]) mx1[s] = __builtin_popcount(s), mx2[s] = (h2[s] ? mx1[s] : 0);
    // for (int s = 1; s < (1 << tot); s++) cout << mx1[s] << " " << mx2[s] << "\n";
    for (int s = 0; s < (1 << tot); s++)
        for (int i = 1; i <= tot; i++)
            if (s & (1 << i - 1))
            {
                if (mx1[s] < mx1[s ^ (1 << i - 1)])
                {
                    if (h1[s] != h1[s ^ (1 << i - 1)]) mx2[s] = mx1[s], h2[s] = h1[s];
                    mx1[s] = mx1[s ^ (1 << i - 1)], h1[s] = h1[s ^ (1 << i - 1)];
                }
                else if (mx2[s] < mx1[s ^ (1 << i - 1)] && h1[s] != h1[s ^ (1 << i - 1)]) mx2[s] = mx1[s ^ (1 << i - 1)], h2[s] = h1[s ^ (1 << i - 1)];
                if (mx2[s] < mx2[s ^ (1 << i - 1)] && h1[s] != h2[s ^ (1 << i - 1)]) mx2[s] = mx2[s ^ (1 << i - 1)], h2[s] = h2[s ^ (1 << i - 1)];
            }
    // for (int s = 1; s < (1 << tot); s++)
    //     cout << mx1[s] << " " << h1[s] << " " << mx2[s] << " " << h2[s] << "\n"; cout << "\n";
    // cout << qry[3] << "\n";
    for (int i = 1; i <= n; i++) cout << ans - res[i] + (h1[qry[i]] == i ? mx2[qry[i]] : mx1[qry[i]]) << "\n";
    return 0;
}