#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
typedef long long ll;
using namespace std;
int n,m;
int a[505][55];
ll sum[505];
int main(){
	cin>>n>>m;
	rep(i,1,n) rep(j,1,m) cin>>a[i][j];
	rep(i,1,n) rep(j,1,m) sum[i]+=a[i][j];
	rep(i,1,n) sort(a[i]+1,a[i]+m+1,greater<int>());
	rep(i,1,n){
		vector<pair<ll,int>>b;
		rep(j,1,n){
			ll s1=sum[i],s2=sum[j],lim=1e9;
			for(int ki=1,kj=1;ki<m||kj<m;a[i][ki]>a[j][kj]?ki++:kj++){
				bool old =(s2<=s1);
				ll v=max(a[i][ki], a[j][kj]);
				s1-=(lim-v)*ki,s2-=(lim-v)*kj;
				lim=v;
				if(!old&&s2<=s1)
					b.push_back(make_pair(lim+(s1-s2)/(kj-ki),1));
				else if(old&&s2>s1)
					b.push_back(make_pair(lim+(s2-s1-1)/(ki-kj),-1));
			}
		}
		sort(b.begin(), b.end(), greater<pair<int, int>>());
		int res=0, cur=0;
		rep(j,1,n) res+=sum[i]>=sum[j];
		cur=res;
		for(auto w:b) cur+=w.second, res=min(res,cur);
		cout<<res<<'\n';
	}
	return 0;
}