#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

const char nl = '\n';

void solve() {
    int N, M; cin >> N >> M;
    vl A[N];
    F0R(i, N) {
        A[i] = vl(M);
        F0R(j, M) cin >> A[i][j];
    }

    vector<pair<int, bool>> ev[N];
    F0R(a, N) {
        FOR(b, a+1, N) {
            vpi ce;
            F0R(i, M) {
                ce.pb({A[a][i], 0});
                ce.pb({A[b][i], 1});
            }
            ll sa = 0, ra = M, sb = 0, rb = M;
            ll lst = 1;
            ev[a].pb({1, 1});
            ev[b].pb({1, 1});
            sort(all(ce));
            trav(x, ce) {
                ll nxt = x.f;
                F0R(iter, 2) {
                    bool oklst = sa + ra * lst >= sb + rb * lst;
                    bool oknxt = sa + ra * nxt >= sb + rb * nxt;
                    if (oklst != oknxt) {
                        ll lo = lst+1, hi = nxt;
                        while (lo < hi) {
                            ll mid = (lo+hi)/2;
                            bool okmid = sa + ra * mid >= sb + rb * mid;
                            if (okmid == oknxt) {
                                hi = mid;
                            } else lo = mid+1;
                        }
                        ev[a].pb({lo, oknxt});
                    }
                    swap(sa, sb);
                    swap(ra, rb);
                    swap(a, b);
                }
                lst = nxt;
                if (x.s == 0) {
                    sa += x.f;
                    ra--;
                } else {
                    sb += x.f;
                    rb--;
                }
            }
        }
    }
    F0R(i, N) {
        sort(all(ev[i]));
        int cur = 0;
        int ans = N;
        F0R(j, sz(ev[i])) {
            /*if (i == 2) {
                cout << ev[i][j].f << " " << ev[i][j].s << endl;
            }*/
            cur += ev[i][j].s*2-1;
            if (j == sz(ev[i])-1 || ev[i][j].f != ev[i][j+1].f) {
                ans = min(ans, cur);
            }
        }
        cout << ans+1 << nl;
    }
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	solve();
	return 0;
}