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

using namespace std;

#define dbg(x) (cout<<#x<<" = "<<(x)<<'\n')
#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "pitici";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

typedef long long int lld;
typedef pair<int, int> PII;
typedef pair<int, lld> PIL;
typedef pair<lld, int> PLI;
typedef pair<lld, lld> PLL;
typedef pair<int, PII> node;

const int INF = (1LL << 30) - 1;
const lld LINF = (1LL << 62) - 1;
const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int NMAX = 2000 + 5;

int N, M, K, cnt;
vector<int> V[NMAX];
vector<int> W[NMAX];
bitset<NMAX> viz;
int C[NMAX][NMAX];
int D[NMAX][NMAX];
int tsort[NMAX];

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

    for(auto y : V[x])
        if(!viz[y])
            dfs(y);

    tsort[++cnt] = x;
}

int main() {
    int i, j, x, y, z, k;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d%d", &N, &M, &K);

    while(M--) {
        scanf("%d%d%d", &x, &y, &z);
        V[x].push_back(y);
        W[y].push_back(x);
        C[x][y] = z;
    }

    for(i = 1; i <= N; i++)
        if(!viz[i])
            dfs(i);

    for(i = 1; i <= N; i++)
        for(j = 1; j <= K + 1; j++)
            D[i][j] = INF;

    D[1][1] = 0;

    for(i = N - 1; i >= 1; i--) {
        x = tsort[i];

        priority_queue<node, vector<node>, greater<node> > PQ;

        for(auto y : W[x])
            PQ.push(make_pair(D[y][1] + C[y][x], make_pair(y, 1)));

        for(j = 1; j <= K; j++) {
            y = PQ.top().second.first;
            k = PQ.top().second.second;
            PQ.pop();

            D[x][j] = min(D[x][j], D[y][k] + C[y][x]);

            PQ.push(make_pair(D[y][k + 1] + C[y][x], make_pair(y, k + 1)));
        }
    }

    for(i = 1; i <= K; i++)
        printf("%d ", D[N][i]);

    return 0;
}