hdoj1031

#include<cstdio>
#include<algorithm>
using namespace std;
typedef struct{
	double v;
	int index;
}design;
bool cmp(design a,design b){
	return a.v>b.v;
}
bool cmp2(design a,design b){
	return a.index>b.index;
}
double vote[1001][1001];
design desig[1001];
int main(){
	int n,m,k,i,j,chose;
	while(scanf("%d %d %d",&n,&m,&k)!=EOF){
		for(i=1;i<=n;i++)
			for(j=1;j<=m;j++) scanf("%lf",&vote[i][j]);
		for(i=1;i<=m;i++){
			desig[i].index=i;
			desig[i].v=0.0;
			for(j=1;j<=n;j++) desig[i].v+=vote[j][i];
		}
		stable_sort(desig+1,desig+m+1,cmp);
		sort(desig+1,desig+k+1,cmp2);
		printf("%d",desig[1].index);
		for(i=2;i<=k;i++) printf(" %d",desig[i].index);
		printf("\n");
	}
}