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
#include <bits/stdc++.h>
#ifdef LOC
#include "debuglib.h"
#else
#define deb(...)
#define DBP(...)
#endif
using namespace std;
using   ll         = long long;
using   vi         = vector<int>;
using   pii        = pair<int, int>;
#define pb           push_back
#define mp           make_pair
#define x            first
#define y            second
#define rep(i, b, e) for (int i = (b); i < (e); i++)
#define each(a, x)   for (auto& a : (x))
#define all(x)       (x).begin(), (x).end()
#define sz(x)        int((x).size())

constexpr ll INF = 1e18;

void run() {
	int n, k, m;
	cin >> n >> k >> m;

	vector<vector<pii>> elems(k);

	rep(i, 0, n) {
		int ki, mi, ci;
		cin >> ki >> mi >> ci;
		elems[ki-1].pb({mi%m, ci});
	}

	vector<ll> prv, cur(m, INF);
	cur[0] = 0;

	each(vec, elems) {
		prv.swap(cur);
		cur.assign(m, INF);
		each(e, vec) {
			rep(r, 0, m-e.x) {
				ll& out = cur[r+e.x];
				out = min(out, prv[r]+e.y);
			}
			rep(r, m-e.x, m) {
				ll& out = cur[r+e.x-m];
				out = min(out, prv[r]+e.y);
			}
		}
	}

	vector<bool> seen(m);
	vector<ll> dp(m, INF);
	dp[0] = 0;

	while (true) {
		pair<ll, int> best = {INF, -1};
		rep(i, 0, m) if (!seen[i]) {
			best = min(best, make_pair(dp[i], i));
		}
		if (best.y == -1) break;
		seen[best.y] = 1;
		rep(r, 0, m-best.y) {
			ll& out = dp[r+best.y];
			out = min(out, best.x+cur[r]);
		}
		rep(r, m-best.y, m) {
			ll& out = dp[r+best.y-m];
			out = min(out, best.x+cur[r]);
		}
	}

	each(v, dp) {
		cout << (v < INF ? v : -1) << '\n';
	}
}

int main() {
	cin.sync_with_stdio(0); cin.tie(0);
	cout << fixed << setprecision(10);
	run();
	cout << flush; _Exit(0);
}