#include <bits/stdc++.h>
using namespace std;
ifstream f ("pitici.in");
ofstream g ("pitici.out");
const int nmax=1133;
int n,m,k,a,b,l,viz[nmax],st[nmax],u,urm,nr[nmax];
vector <int> v[nmax];
vector <int> c[nmax];
multiset <int> usu[nmax];
void dfs(int nod)
{
    viz[nod]=1;
    for(int i=0;i<v[nod].size();++i)
    {
        if(viz[v[nod][i]]) continue;
        dfs(v[nod][i]);
    }
    st[++u]=nod;
}
void sortaret()
{
    for(int i=1;i<=n;++i)
    {
        if(!viz[i]) dfs(i);
    }
}
void adaug(int nod)
{
    for(int i=0;i<v[nod].size();++i)
    {
        urm=v[nod][i];
        for(multiset <int>::iterator it=usu[nod].begin();it!=usu[nod].end();++it)
        {
            if(usu[urm].size()<k)
            {
                usu[urm].insert(*it+c[nod][i]);
                continue;
            }
            if(*it+c[nod][i]<*usu[urm].rbegin())
            {
                usu[urm].erase(*usu[urm].rbegin());
                usu[urm].insert(*it+c[nod][i]);
            }
            else break;
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    f>>n>>m>>k;
    for(int i=1;i<=m;++i)
    {
        f>>a>>b>>l;
        v[a].push_back(b);
        c[a].push_back(l);
    }
    nr[1]=1;
    sortaret();
    reverse(st+1,st+n+1);
    usu[1].insert(0);
    for(int i=1;i<n;++i)
    {
        adaug(st[i]);
        usu[i].clear();
    }
    for(multiset <int>::iterator it=usu[n].begin();it!=usu[n].end();++it) g<<*it<<' ';
    return 0;
}