#include <cstdio>
#define MAXN 1019
#define MAXK 101
#define MAXM 200019
int q, k, f, u, t[MAXN+1], val[MAXM+1], cost[MAXM+1], next[MAXM+1], lista[MAXN+1];
int heap[MAXN], d[MAXN+1], s[MAXN+1][MAXK], v[MAXN+1], l[MAXN+1], viz[MAXN+1];
inline void adauga(int x, int y, int z){
    f++;
    val[f]=y;
    cost[f]=z;
    next[f]=lista[x];
    lista[x]=f;
}
void dfs(int x){
    int p=lista[x];
    viz[x]=1;
    while(p){
        if(viz[val[p]]==0){
            dfs(val[p]);
        }
        p=next[p];
    }
    t[u++]=x;
}
inline int tata(int p){
    return (p-1)/2;
}
inline int fiust(int p){
    return 2*p+1;
}
inline int fiudr(int p){
    return 2*p+2;
}
inline void swap(int a, int b){
    int aux=heap[a];
    heap[a]=heap[b];
    heap[b]=aux;
}
inline void urcare(int p){
    while((p>0)&&(d[heap[p]]<d[heap[tata(p)]])){
        swap(p, tata(p));
        p=tata(p);
    }
}
inline void coborare(int p){
    int r, f=1;
    while((f)&&(fiust(p)<q)){
        r=fiust(p);
        if((fiudr(p)<q)&&(d[heap[fiudr(p)]]<d[heap[r]])){
            r=fiudr(p);
        }
        if(d[heap[r]]<d[heap[p]]){
            swap(p, r);
            p=r;
        }else{
            f=0;
        }
    }
}
inline void solve(int x){
    int p=lista[x];
    q=0;
    while(p){
        if(v[val[p]]>0){
            l[val[p]]=0;
            d[val[p]]=cost[p]+s[val[p]][0];
            heap[q]=val[p];
            q++;
            urcare(q-1);
        }
        p=next[p];
    }
    while((v[x]<k)&&(q>0)){
        s[x][v[x]++]=d[heap[0]];
        l[heap[0]]++;
        if(l[heap[0]]<v[heap[0]]){
            d[heap[0]]+=s[heap[0]][l[heap[0]]]-s[heap[0]][l[heap[0]]-1];
            coborare(0);
        }else{
            q--;
            heap[0]=heap[q];
            coborare(0);
        }
    }
}
int main(){
    int n, m, i, x, y, z;
    FILE *fin, *fout;
    fin=fopen("pitici.in", "r");
    fout=fopen("pitici.out", "w");
    fscanf(fin, "%d%d%d", &n, &m, &k);
    for(i=0; i<m; i++){
        fscanf(fin, "%d%d%d", &x, &y, &z);
        adauga(x, y, z);
    }
    dfs(1);
    v[n]=1;
    s[n][0]=0;
    for(i=0; i<u; i++){
        solve(t[i]);
    }
    for(i=0; i<k; i++){
        fprintf(fout, "%d ", s[1][i]);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}