#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;
using pii = pair<int, int>;

void dfs(int nod, int tot, vector<vector<pii>> &G, vector<int> &ans) {
    if (nod == 1) {
        ans.emplace_back(tot);
        return;
    }

    for (auto &[nod2, pret]: G[nod])
        dfs(nod2, tot + pret, G, ans);
}

int main() {
    ifstream f("pitici.in");
    ofstream g("pitici.out");

    int n, m, k, a, b, cost;
    f >> n >> m >> k;

    vector<vector<pii>> G(n + 1);

    while (m--) {
        f >> a >> b >> cost;
        G[b].emplace_back(a, cost);
    }

    vector<int> ans;
    dfs(n, 0, G, ans);

    sort(ans.begin(), ans.end());

    for (int i = 0; i < k; ++i)
        g << ans[i] << ' ';
}