/* Problem URL: https://cses.fi/problemset/task/1196 */

#include <bits/stdc++.h>

using namespace std;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m, k;
    cin >> n >> m >> k;

    V<V<pair<int, ll>>> graph(n);

    while (m--) {
        int a, b, c;
        cin >> a >> b >> c;
        a--, b--;

        graph[a].emplace_back(b, c);
    }

    ll inf = INT64_MAX >> 1;
    V<multiset<ll>> dis(n, multiset<ll>({inf}));

    auto dijkstra = [&]() {
        dis[0].insert(0);
        priority_queue<pair<ll, int>, V<pair<ll, int>>, greater<>> pq;
        pq.emplace(0, 0);

        while (!pq.empty()) {
            auto [c, i] = pq.top();
            pq.pop();

            if (c > *prev(dis[i].end())) {
                continue;
            }

            for (auto [j, cc] : graph[i]) {
                if (dis[j].size() < k || c + cc < *prev(dis[j].end())) {
                    dis[j].insert(c + cc);
                    pq.emplace(c + cc, j);
                    if (dis[j].size() > k) {
                        dis[j].erase(prev(dis[j].end()));
                    }
                }
            }
        }
    };

    dijkstra();

    for (auto i : dis.back()) {
        cout << i << ' ';
    }
    cout << '\n';
}