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
#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())
#ifdef DEBUG
auto operator<<(auto&o,auto x)->decltype(x.end(),o);
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto&operator<<(auto&o,tuple<auto,auto,auto>t){return o<<"("<<get<0>(t)<<", "<<get<1>(t)<<", "<<get<2>(t)<<")";}
auto&operator<<(auto&o,tuple<auto,auto,auto,auto>t){return o<<"("<<get<0>(t)<<", "<<get<1>(t)<<", "<<get<2>(t)<<", "<<get<3>(t)<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

template<typename T>
void self_min(T& x, T y) {
	x = min(x, y);
}

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int n, k, m;
	cin >> n >> k >> m;
	debug(n, k, m);

	vector<vector<pair<int, int>>> candy(k);
	REP(i, n) {
		int color, w, c;
		cin >> color >> w >> c;
		--color;
		candy[color].emplace_back(w, c);
	}
	debug(candy);

	const LL INF = 1e18;
	vector dp(k + 1, vector (m, INF));
	dp[0][0] = 0;
	REP(i, k) {
		for (auto [w, c] : candy[i]) {
			int p = w == m ? 0 : w;
			REP(j, m) {
				self_min(dp[i + 1][p], dp[i][j] + c);
				++p;
				if (p == m)
					p = 0;
			}
		}
	}
	//debug(dp);

	const auto moves = dp[k];
	debug(moves);

	vector dist(m, INF);
	dist[0] = 0;
	vector<bool> visited(m);
	REP(i, m) {
		pair<LL, int> best = {INF, -1};
		REP(j, m) {
			if (visited[j])
				continue;
			self_min(best, pair(dist[j], j));
		}
		const auto [_, id] = best;
		//debug(i, id, dist);
		if (id == -1)
			break;
		visited[id] = true;
		int p = id;
		REP(j, m) {
			self_min(dist[p], dist[id] + moves[j]);
			++p;
			if (p == m)
				p = 0;
		}
	}
	debug(dist);

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