#include <fstream>
#include <vector>
#include <set>

using namespace std;

ifstream fin ("pitici.in");
ofstream fout ("pitici.out");

int n, m, k, l, PO[1024];
bool F[1024];
vector < int > S[1024];
vector < pair < int, int > > G[1024];
multiset < pair < int, int > > H;

void DFS(int node)
{
    F[node] = true;
    for (vector < pair < int, int > > :: iterator it = G[node].begin(); it != G[node].end(); it ++)
    {
        if (!F[it->first])
        {
            DFS(it->first);
        }
    }
    PO[++PO[0]] = node;
}

int main()
{
    fin >> n >> m >> k;
    for (int a, b, c, i = 1; i <= m; i ++)
    {
        fin >> a >> b >> c;
        G[a].push_back( { b, c } );
    }
    DFS(1);
    H.insert( { 0, 1 } );
    while (!H.empty())
    {
        pair < int, int > node = *H.begin();
        H.erase(H.begin());
        if (S[node.second].size() < k) S[node.second].push_back(node.first);

        for (vector < pair < int, int > > :: iterator it = G[node.second].begin(); it != G[node.second].end(); it ++)
        {
            if (S[it->first].size() < k)
            {
                H.insert( { node.first + it->second, it->first } );
            }
        }
    }
    for (int i = 0; i < S[n].size(); i ++)
    {
        fout << S[n][i] << ' ';
    }

    fout << '\n';
    fout.close();
    return 0;
}