#include <bits/stdc++.h>
using namespace std;
int n,m;
struct node{
	string nm;
	int ch[25]={0};
	double pj=0.0,h=0.0;
}xy[100000];
bool cmp(node a,node b){
	if (a.h==b.h) return a.nm<b.nm;
	return a.h>b.h;
}
int main(){
	cin>>n>>m;
	for (int i=0;i<n;i++){
		cin>>xy[i].nm;
		double cnt=0;
		for (int j=0;j<m;j++){
			int q=0;
			cin>>q;
			cnt+=q;
			xy[i].ch[j]=q;
		}
		xy[i].pj=(cnt+0.000000)/m;
	}
	for (int i=0;i<n;i++){
		for (int j=0;j<m;j++){
			xy[i].h+=(xy[i].ch[j]-xy[i].pj)*(xy[i].ch[j]-xy[i].pj);
		}
		xy[i].h=sqrt(xy[i].h/3);
	}
	sort(xy,xy+n,cmp);
	for (int i=0;i<n;i++){
		cout<<xy[i].nm<<"\n";
	}
	return 0;
}