#include <iostream>
#include <cstdio>
using namespace std;
int n,m,temp[100]={0},ansmax=99999,p;
int i,k,leng[100][100],j,lp=0,answer[100]={0};
const int MAX=9000000;
int shortest(){
    	int nowmin=MAX,nowmax=0;
    	for(i=0;i<n;i++){
    		nowmin=MAX;
    		for(j=0;j<lp;j++){
    			if(leng[i][temp[j]]<nowmin) nowmin=leng[i][temp[j]];
    		}
    		if(nowmin>nowmax) nowmax=nowmin;
    	}
    	return nowmax;
}
void dfs(int x,int nowmax){
    	if(lp==p){
    		nowmax=shortest();
    		if(nowmax<ansmax){
    			for(i=0;i<p;i++) answer[i]=temp[i];
    			ansmax=nowmax;
    		}
    		lp--;
    		return;
    	}
    	int i;
    	for(i=x+1;i<n;i++){
    		temp[lp]=i,lp++;
    		dfs(i,nowmax);
    	}
    	lp--;
    	return;
    }
int main(){
freopen("djsc.in","r",stdin);
freopen("djsc.out","w",stdout);
cin>>n>>m>>p;
int x,y,z;
for(k=0;k<n;k++){
    		for(i=0;i<n;i++){
    			leng[k][i]=MAX;
    		}
        }
for(int i=1;i<=m;i++){
cin>>x>>y>>z;
leng[x][y]=z;
leng[y][x]=z;
}
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(leng[i][j]>leng[i][k]+leng[k][j])
leng[i][j]=leng[i][k]+leng[k][j];
for(int j=0;j<n;j++)
	leng[j][j]=0;
dfs(-1,MAX);
for(int i=0;i<p;i++)
	cout<<answer[i]<<' ';
cout<<endl;
return 0;
}