#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

const int nmax = 1025;

int n, m, k, x, y, z, i, j, cnt, dist, node;
int tsort[nmax], where[nmax], ways[nmax], cost[nmax], d[nmax][nmax];

vector<pii> v[nmax], g[nmax];
bitset<nmax> viz;
priority_queue<pii, vector<pii>, greater<pii>> q;

void dfs(int x)
{
    viz[x] = 1;

    for(auto it : v[x])
        if(!viz[it.fi])
            dfs(it.fi);

    tsort[++cnt] = x;
}

int main()
{
    freopen("pitici.in", "r", stdin);
    freopen("pitici.out", "w", stdout);

    scanf("%d%d%d", &n, &m, &k);

    for(; m; m--)
    {
        scanf("%d%d%d", &x, &y, &z);
        v[x].pb(mp(y, z));
        g[y].pb(mp(x, z));
    }

    dfs(1);

    d[1][1] = 0;
    ways[1] = 1;

    for(i = n - 1; i; i--)
    {
        x = tsort[i];
        while(!q.empty()) q.pop();

        for(auto it : g[x])
        {
            q.push(mp(it.se + d[it.fi][1], it.fi));
            cost[it.fi] = it.se;
            where[it.fi] = 1;
        }

        for(j = 1; j <= k && !q.empty(); j++)
        {
            dist = q.top().fi;
            node = q.top().se;
            q.pop();

            d[x][j] = dist;
            ways[x] = j;

            if(++where[node] <= ways[node])
                q.push(mp(cost[node] + d[node][where[node]], node));
        }
    }

    for(i = 1; i <= k; i++)
        printf("%d ", d[n][i]);

    return 0;
}