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
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<queue>
#include<stack>
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<VLL > VVLL;
typedef vector<VLD > VVLD;
typedef vector<PII > VPII;
typedef __int128 int128;
template<class TIn>
using indexed_set = tree<
        TIn, null_type, less<TIn>,
        rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define THIS (*this)
#define LSB(x) (x & -x)
#define SQR(x) ((x)*(x))

const LL INF = 2e18;
int n, k, m; 
vector<VPII > col;
VVLL memo;

LL dp(int i, int mi) {
    if (i < 0) return mi == 0 ? 0 : INF;
    if (memo[i][mi] != -1) return memo[i][mi];
    LL ans = INF;
    REP(j, col[i].size()) ans = min(ans, col[i][j].ND + dp(i - 1, (mi - col[i][j].ST + m) % m));
    return memo[i][mi] = ans;
}

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    cin >> n >> k >> m;
    col.resize(k);
    REP(i, n) {
        int ki, mi, ci; cin >> ki >> mi >> ci;
        col[--ki].PB({mi % m, ci});
    }
    memo.assign(k, VLL(m, -1));
    VLL ans(m);
    min_heap<pair<LL, int> > q;
    FOR(i, 1, m - 1) {
        ans[i] = dp(k - 1, i);
        if (ans[i] != INF) q.push({ans[i], i});
    }
    while (!q.empty()) {
        auto [d, u] = q.top(); q.pop();
        if (d > ans[u]) continue;
        FOR(v, 1, m - 1) {
            if (ans[v] == INF) continue;
            int w = (u + v) % m;
            if (ans[u] + ans[v] < ans[w]) {
                ans[w] = ans[u] + ans[v];
                q.push({ans[w], w});
            }
        }
    }
    REP(i, m) if (ans[i] == INF) cout << "-1\n"; else cout << ans[i] << '\n';

    return 0;
}