#include <bits/stdc++.h>
using namespace std;
int m,n,a,maxx=-10,minn=114514;
double p[120],q[120]; 
bool cmp(int x,int y){
	return x>y;
}
int main(){
	cin>>n>>m;
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			cin>>a;
			maxx=max(a,maxx);
			minn=min(a,minn);
			p[i]+=a;
		}
		p[i]=p[i]-maxx-minn,p[i]/=m-2;
		maxx=-10,minn=114514;
		q[i]=p[i];
	}
	sort(p+1,p+n+1,cmp);
	for(int i=1; i<=n; i++){
		for(int j=1; j<=n; j++){
			if(p[i]==q[j]) {
				cout<<j<<" ";
				q[j]=0; 
			}
		} 
	}
    return 0;
}