1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include <bits/stdc++.h>

using namespace std;
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())

template<class A, class B> auto &operator<<(ostream &o, pair<A, B> p) {
    return o << '(' << p.first << ", " << p.second << ')';
}

template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
    o << '{'; int i = 0; for (auto e : x) o << (", ")+2*!i++ << e;
    return o << '}';
}

#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n';
#else
#define debug(...) {}
#endif


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

    constexpr LL inf = (LL) (1e18 + 3);
    int n, k, m;
    int x, y, z, r, idx;
    LL c;
    cin >> n >> k >> m;
    vector<vector<pair<int, int>>> cols(k + 1);

    REP(i, n) {
        cin >> x >> y >> z;
        if (y == m)
            y = 0;
        cols[x].emplace_back(y, z);
    }

    vector<vector<LL>> dp(k + 1, vector<LL>(m, inf));
    dp[0][0] = 0;
    FOR(i, 1, k) {
        for (auto [wgt, cst] : cols[i]) {
            idx = wgt;
            REP(j, m) {
                dp[i][idx] = min(dp[i][idx], dp[i - 1][j] + cst);
                idx++;
                if (idx == m)
                    idx = 0;
            }
        }
    }

    vector<pair<int, LL>> av;
    FOR(i, 1, m - 1) {
        if (dp[k][i] != inf)
            av.emplace_back(i, dp[k][i]);
    }

    auto dijkstra = [&]() {
        priority_queue<pair<LL, int>, vector<pair<LL, int>>, greater<>> q;
        vector<LL> dis(m, inf);
        vector<bool> vis(m);
        dis[0] = 0;
        q.push({0, 0});

        while (!q.empty()) {
            auto [cst, rst] = q.top();
            q.pop();
            if (vis[rst])
                continue;
            vis[rst] = true;

            for (auto &[rst2, cst2] : av) {
                r = rst + rst2;
                c = cst + cst2;
                if (r >= m)
                    r -= m;
                if (c < dis[r]) {
                    dis[r] = c;
                    q.push({c, r});
                }
            }
        }

        REP(i, m)
            cout << (dis[i] == inf ? -1 : dis[i]) << '\n';
    };

    dijkstra();

    return 0;
}