#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
int n, m, k, i, j, in[1020], p;
vector<pair<int, int> > graph[1020];
vector<int> sol[1020];
queue<int> q;
char c[30];
int read();
vector<int> inter(vector<int> a, vector<int> b, int val);
int main()
{
    freopen("pitici.in", "r", stdin);
    freopen("pitici.out", "w", stdout);
    fgets(c, 30, stdin); p=-1;
    n=read(); m=read(); k=read();
    for(i=1; i<=m; ++i){
        int x, y, z;
        fgets(c, 30, stdin); p=-1;
        x=read(); y=read(); z=read();
        graph[x].push_back({y, z});
        ++in[y];
    }
    sol[1].push_back(0);
    for(q.push(1); !q.empty(); q.pop()){
        int node=q.front();
        for(auto i:graph[node]){
            sol[i.first]=inter(sol[i.first], sol[node], i.second);
            --in[i.first];
            if(in[i.first]==0) q.push(i.first);
        }
        if(node!=n)sol[node].clear();
    }
    for(i=0; i<k; ++i) printf("%d ", sol[n][i]);
    return 0;
}
int read(){
    ++p; int nr=0;
    while(c[p]!='\n' && c[p]!=' ') {nr=nr*10+(c[p]-'0'); ++p;}
    return nr;
}
vector<int> inter(vector<int> a, vector<int> b, int val){
    int i=0, j=0, sza=a.size(), szb=b.size();
    vector<int> c;
    while(c.size()<=k && i<sza && j<szb){
        if(a[i]<=b[j]+val) c.push_back(a[i++]);
        else c.push_back(b[j++]+val);
    }
    while(c.size()<=k && i<sza) c.push_back(a[i++]);
    while(c.size()<=k && j<szb) c.push_back(b[j++]+val);
    return c;
}