#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::cin.tie(nullptr)->sync_with_stdio(false);

    int n, m;
    std::cin >> n >> m;

    std::vector a(n, std::vector<int>(m));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            std::cin >> a[i][j];
        }
        std::sort(a[i].begin(), a[i].end());
        a[i].push_back(2e9);
    }
    
    auto work = [&](int x) {
        std::vector<std::pair<int, int>> s;
        for (int y = 0; y < n; ++y) {
            if (y != x) {
                int i = 0, j = 0, k = 0;
                i64 f = 0, g = 0;
                while (i < m || j < m) {
                    int nk = std::min(a[x][i], a[y][j]);
                    i64 nf = f + 1ll * (m - i) * (nk - k);
                    i64 ng = g + 1ll * (m - j) * (nk - k);
                    if (f < g && nf >= ng) {
                        s.emplace_back((g - f - 1) / (j - i) + 1 + k, -1);
                    } else if (f >= g && nf < ng) {
                        s.emplace_back((f - g) / (i - j) + 1 + k, 1);
                    }
                    k = nk;
                    f = nf;
                    g = ng;
                    while (a[x][i] == nk) {
                        ++i;
                    }
                    while (a[y][j] == nk) {
                        ++j;
                    }
                }
            }
        }

        std::sort(s.begin(), s.end());
        int sum = n, ans = n;
        for (auto [p, x] : s) {
            sum -= x;
            ans = std::min(ans, sum);
        }

        return ans;
    };

    for (int i = 0; i < n; ++i) {
        std::cout << work(i) << "\n";
    }

    return 0;
}