#include <bits/stdc++.h>
using
namespace
std;
int
a[1010][15],i,j,n,m,k,tmp;
int
main()
{
cin>>n>>m>>k;
for
(i=1;i<=n;i++){
a[i][0]=i;
tmp=0;
for
(j=1;j<=k;j++){
scanf
(
"%d"
,&a[i][j]);
a[i][k+1]+=a[i][j];
tmp+=(a[i][j]*a[i][j]);
}
a[i][k+1]/=k;
tmp=(tmp-k*a[i][k+1]*a[i][k+1])/k;
a[i][k+2]=tmp;
}
for
(i=1;i<n;i++)
for
(j=1;j<=n-i;j++)
if
(a[j][k+1]<a[j+1][k+1])
swap(a[j],a[j+1]);
int
p,q;
p=1;
while
(p<=m) {
while
(a[p][k+1]!=a[p+1][k+1] && p<=m) p++;
q=p+1;
while
(a[q][k+1]==a[p][k+1]) q++;
q--;
for
(i=p;i<q;i++){
for
(j=p;j<=p+q-i-1;j++)
if
(a[j][k+2]>a[j+1][k+2])
swap(a[j],a[j+1]);
}
p=q+1;
}
for
(i=1;i<=m;i++) cout<<a[i][0]<<
" "
;
}