#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
int n, m, arr[505][55], ans[505], order[505], pos[505];
ll A[505], B[505];
vector<int> ord, diff;
vector<pair<ll, pii> > point;
ll last_val = -1;
ll solve(ll a1, ll b1, ll a2, ll b2){
    if (a1 == a2) return -1;
    return (b2 - b1) / (a1 - a2);
}
void intersect(int a, int b){
    vector<pii> val;
    int pa = m, pb = m, suma = 0, sumb = 0;
    for (int h = 1; h <= m; h++)
        val.emplace_back(arr[a][h], 0),
        val.emplace_back(arr[b][h], 1);
    sort(all(val));
    for (int i = 1; i < val.size(); i++){
        ll l = val[i - 1].F, r = val[i].F;
        if (val[i - 1].S == 0)
            suma += val[i - 1].F, pa--;
        else sumb += val[i - 1].F, pb--;
        ll meet = solve(pa, suma, pb, sumb);
        if (meet >= l && meet <= r){
            point.emplace_back(meet - 1, pii(a, b));
            point.emplace_back(meet, pii(a, b));
            point.emplace_back(meet + 1, pii(a, b));
        }
    }
}
int find(int i, ll p){
    int l = 0, r = n;
    // cerr << "find " << i << " : \n";
    while (l < r){
        int mid = (l + r) >> 1;
        // cerr << ord[mid] << " " << A[ord[mid]] * p + B[ord[mid]] << " " << A[i] * p + B[i] << '\n';
        if (A[ord[mid]] * p + B[ord[mid]] <= A[i] * p + B[i])
            l = mid + 1;
        else r = mid;
    }
    return l;
}
void solve(ll p){
    if (diff.empty())
        return;
    vector<pll> val;
    vector<int> have_pos;
    sort(all(diff)), diff.resize(unique(all(diff)) - diff.begin());
    for (auto i : diff){
        val.emplace_back(A[i] * p + B[i], i);
        have_pos.emplace_back(pos[i]);
    }
    sort(all(val)), sort(all(have_pos));
    for (int i = 0; i < val.size(); i++){
        ord[have_pos[i]] = val[i].S;
        pos[val[i].S] = have_pos[i];
    }
    // for (int i = 1; i <= n; i++)
    //     cerr << ord[i - 1] << " \n"[i == n];
    for (auto i : diff){
        // cerr << "count " << p << " " << i << " : \n" << find(i, p) << '\n';
        ans[i] = min(ans[i], find(i, p));
    }
    // for (int i = 1; i <= n; i++)
    //     cerr << pos[i] << " \n"[i == n];
    diff.clear();
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++)
            cin >> arr[i][j];
        sort(arr[i] + 1, arr[i] + 1 + m);
    }
    for (int i = 1; i <= n; i++){
        for (int j = i + 1; j <= n; j++)
            intersect(i, j);
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            point.emplace_back(arr[i][j], pii(-i, -i));
    sort(all(point));
    for (int i = 1; i <= n; i++)
        ord.emplace_back(i), pos[i] = i - 1;
    fill(ans, ans + n + 1, n);
    fill(A, A + n + 1, m);
    for (auto [p, type] : point){
        if (p != last_val)
            solve(p);
        if (type.F != type.S){
            diff.emplace_back(type.F);
            diff.emplace_back(type.S);
        }
        else 
            A[-type.F]--, B[-type.F] += p;
        last_val = p;
    }
    solve(last_val);
    for (int i = 1; i <= n; i++)
        cout << ans[i] << "\n";
}
/*
6 4
3 1 2 2 
4 3 2 2
6 6 3 2
7 3 4 3
3 4 2 4
2 3 3 5
*/