#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

const int N=505;
const int H=55;
int a[N][H],n,h;
const ll lim=1e18;

ll GetVal(int i,int isz,int j,int jsz){
    if(isz>h && jsz>h)return lim;
    if(isz>h || (jsz<=h && a[i][isz]>a[j][jsz])){
        return a[j][jsz];
    }else{
        return a[i][isz];
    }
}

ll Get(int k,ll n,ll x){
    return x*k+n;
}

vector<pair<ll,int>> evs;
void AddInterval(ll L, ll R){
    //printf("Add interval [%lld %lld]\n",L,R);
    evs.pb({L,1});
    evs.pb({R+1,-1});
}

ll Inter1(int ik,ll in,int jk,ll jn){
    ll dn=in-jn;
    ll dk=jk-ik;
    if(dk<0)dk=-dk,dn=-dn;
    return dn/dk;
}

ll Inter2(int ik,ll in,int jk,ll jn){
    ll dn=in-jn;
    ll dk=jk-ik;
    if(dk<0)dk=-dk,dn=-dn;
    return (dn+dk-1)/dk;
}

void Solve(int ik,ll in,int jk,ll jn,ll from,ll to){
    if(from>to)return;
    //printf("Solve [%lld %lld]\n",from,to);

    ll fi=Get(ik,in,from);
    ll fj=Get(jk,jn,from);
    ll ti=Get(ik,in,to);
    ll tj=Get(jk,jn,to);

    if(fi>=fj && ti>=tj){
        AddInterval(from,to);
    }else if(fi>=fj){
        AddInterval(from,Inter1(ik,in,jk,jn));
    }else if(ti>=tj){
        AddInterval(Inter2(ik,in,jk,jn),to);
    }
}
int main(){
    scanf("%i %i",&n,&h);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=h;j++){
            scanf("%i",&a[i][j]);
        }
        sort(a[i]+1,a[i]+1+h);
    }
    for(int i=1;i<=n;i++){
        evs.clear();
        for(int j=1;j<=n;j++){
            if(i==j)continue;
            int isz=1,jsz=1;
            ll in=0,jn=0;
            int ik=h,jk=h;
            ll from=1,to=GetVal(i,isz,j,jsz)-1;
            Solve(ik,in,jk,jn,from,to);
            while(isz<=h || jsz<=h){
                ll val=GetVal(i,isz,j,jsz);

                while(isz<=h && a[i][isz]==val){
                    ik--;
                    in+=a[i][isz];
                    isz++;
                }
                while(jsz<=h && a[j][jsz]==val){
                    jk--;
                    jn+=a[j][jsz];
                    jsz++;
                }

                ll from=val,to=GetVal(i,isz,j,jsz)-1;

                Solve(ik,in,jk,jn,from,to);
            }
        }
        evs.pb({1,1});
        evs.pb({lim,1});
        sort(evs.begin(),evs.end());
        int now=0;
        ll last=1;
        int ans=n;
        for(auto ev:evs){
            if(last<ev.first){
                //printf("(%lld %lld) -> %i\n",last,ev.first-1,now);
                ans=min(ans,now);
            }
            now+=ev.second;
            last=ev.first;
        }
        printf("%i\n",ans);
    }
    return 0;
}