#include <bits/stdc++.h>

using namespace std;

const short int NMAX = 1028;

vector<pair<short int, short int>> adj[NMAX];
short int grad[NMAX];

queue<short int> q;

vector<short int> v[NMAX];
int main() {
    ifstream cin("pitici.in");
    ofstream cout("pitici.out");
    int n, m, k, a, b, val;
    cin>>n>>m>>k;

    for(int i=0; i<m; i++) {
        cin>>a>>b>>val;
        adj[a].push_back({b, val});
        grad[b] ++;
    }

    for(int i=1; i<=n; i++)
        if(grad[i] == 0)
            q.push(i);

    v[1].push_back(0);

    while(q.empty() == false) {
        short int curr = q.front();
        q.pop();





        sort(v[curr].begin(), v[curr].end());

        for(int i = 0; i < min(k, (int)v[curr].size()); i ++){
            int old_value = v[curr][i];
            //cout<<"!"<<i<<" "<<curr<<" "<<old_value<<'\n';

            for(auto x : adj[curr]) {
              //cout<<"!!"<<x.first<<" "<<x.second<<'\n';
                int new_value = old_value + x.second;
                v[x.first].push_back(new_value);
            }
        }





        for(auto x : adj[curr]) {
            grad[x.first]--;
            if(grad[x.first] == 0)
                q.push(x.first);
        }
    }

    sort(v[n].begin(), v[n].end());
    for(int i=0; i<k; i++)
      cout<<v[n][i]<<" ";



    return 0;
}