#include <set>
#include <queue>
#include <cmath>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#define debug(x) //cerr<<#x<<'='<<x<<endl
#define set0(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
template<typename T> void read(T &x){
	x = 0;char ch = getchar();ll f = 1;
	while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
	while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}

ll p,h,val[510][55];

int main() {
	read(p);read(h);
	for(int i=0;i<p;i++){
		for(int j=0;j<h;j++){
			read(val[i][j]);
		}
		sort(val[i],val[i]+h);
		val[i][h] = 1e10;
	}
	for(int i=0;i<p;i++){
		vector< pii > V;
		for(int j=0;j<p;j++){
			if(i == j)continue;
			ll a = 0,b = 0;
			ll sa = 0,sb = 0;
			//cout<<"Case #"<<i<<" : "<<j<<endl;
			while(!(a == h && b == h)){
				ll cv = min(val[i][a],val[j][b]);
				
				while(a!=h && val[i][a] == cv)sa+=cv,a++;
				while(b!=h && val[j][b] == cv)sb+=cv,b++;
				//cout<<"    "<<cv<<" a:"<<a<<" b:"<<b<<endl;
				debug(sa+cv*(h-a));
				debug(sb+cv*(h-b));
				ll nv = min(val[i][a],val[j][b]);
				debug(sa+nv*(h-a));
				debug(sb+nv*(h-b));
				if(sa+cv*(h-a)>=sb+cv*(h-b) && sa+nv*(h-a)<sb+nv*(h-b)){
					V.push_back(make_pair((sa-sb)/(a-b)+1,1));
				//	cout<<"    Add Pos"<<(sa-sb)/(a-b)+1<<endl;
				}
				if(sa+cv*(h-a)<sb+cv*(h-b) && sa+nv*(h-a)>=sb+nv*(h-b)){
					V.push_back(make_pair((sb-sa+b-a-1)/(b-a),-1));
				//	cout<<"    Sub Pos"<<(sb-sa+b-a-1)/(b-a)<<endl;
				}
			}
		}
		sort(V.begin(),V.end());
		ll ans = 0,cv = 0;
		for(auto ct:V){
			cv+=ct.second;
			ans = max(ans,cv);
		}
		cout<<p-ans<<'\n';
	}
	return 0;
}