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
#include "bits/stdc++.h" // Ignacy Boehlke
using namespace std;     // XIII LO Szczecin
auto operator<<(auto&o,auto p)->decltype(p.first,o){return o<<'{'<<p.first<<", "<<p.second<<'}';}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<'{';int i=2;for(auto e:x)o<<(", ")+i<<e,i=0;return o<<'}';}
#ifdef DEBUG
#define PF(x...)fprintf(stderr,x)
#define LOG(x...)cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<'\n';}(x)
#else
#define PF(...)(void)0
#define LOG(...)(void)0
#endif
#define FOR(a,b,c)for(int a=(b);a<=(c);++a)
#define REP(a,b)FOR(a,0,(b)-1)
#define ALL(x)(x).begin(), (x).end()
#define fi first
#define se second
using ll=int64_t;

int main() {
        cin.tie(0)->sync_with_stdio(0);
        int n, k, m;
        cin >> n >> k >> m;
        vector<vector<array<int, 2>>> av(k);
        REP(i, n) {
                int col, w, c;
                cin >> col >> w >> c; --col;
                av[col].push_back({w, c});
        }

        constexpr ll INF = LLONG_MAX / 2;

        vector<ll> price = [&]() {
                vector<ll> dp(m, INF);
                dp[0] = 0;
                REP(i, k) {
                        vector<ll> ndp(m, INF);
                        for (auto [w, c] : av[i])
                                REP(j, m) ndp[j] = min(ndp[j], dp[(j - w + m) % m] + c);
                        dp = std::move(ndp);
                }
                return dp;
        }();
        LOG(price);

        vector<ll> res(m, INF);
        res[0] = 0;
        priority_queue<pair<ll, int>> PQ;
        PQ.emplace(0, 0);
        while (!PQ.empty()) {
                auto [c, v] = PQ.top();
                PQ.pop();
                c = -c;
                if (c != res[v]) continue;
                FOR(e, 1, m - 1) {
                        int u = (v + e) % m;
                        if (c + price[e] < res[u]) {
                                res[u] = c + price[e];
                                PQ.emplace(-res[u], u);
                        }
                }
        }
        REP(i, m) cout << (res[i] == INF ? -1 : res[i]) << '\n';
}