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
97
98
99
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>

using namespace std;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) (int)(x).size()
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define REP(x, n) for(int x = 0; x < (n); x++)
#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 VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__)

typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

const int MXN = 1000000;
const int C = 262144;
const LL INF = (1LL << 60);
const int MOD = 1000000007;

int n, k, m;
VI mass[MXN], cost[MXN];
LL D[2][MXN];
LL Q[MXN];
LL res[MXN];

void test() {
    scanf("%d %d %d", &n, &k, &m);
	FOR(i, 1, n) {
		int ki, mi, ci;
		scanf("%d %d %d", &ki, &mi, &ci);
		mass[ki].PB(mi);
		cost[ki].PB(ci);
	}
	FOR(i, 0, m - 1)
		D[0][i] = D[1][i] = INF;
	D[1][0] = 0;
	FOR(i, 1, k) {
		FOR(j, 0, m - 1)
			D[(i + 1) % 2][j] = INF;
		FOR(j, 0, SIZE(mass[i]) - 1) {
			FOR(o, 0, m - 1) {
				if(D[i % 2][o] != INF) {
					LL wyn = D[i % 2][o] + cost[i][j];
					D[(i + 1) % 2][(o + mass[i][j]) % m] = min(D[(i + 1) % 2][(o + mass[i][j]) % m], wyn);
				}
			}		
		}
	}
	FOR(i, 0, m - 1) {
		Q[i] = D[(k + 1) % 2][i];
		res[i] = INF;
	}
	res[0] = 0;
	std::priority_queue<pair<LL, int>, std::vector<pair<LL, int> >, std::greater<pair<LL, int> > > dij;
	dij.push(MP(0, 0));
	
	while(!dij.empty() ) {
		pair<LL, int> p1 = dij.top();
		dij.pop();
		if(p1.F > res[p1.S])
			continue;
		FOR(o, 0, m - 1) {
			LL wyn = p1.F + Q[o];
			if(res[(p1.S + o) % m] > wyn) {
				dij.push(MP(wyn, (p1.S + o) % m));
				res[(p1.S + o) % m] = wyn;
			}
		}
	}

	FOR(i, 0, m - 1) {
		if(res[i] == INF)
			res[i] = -1;
		printf("%lld\n", res[i]);
	}
}

int main() {
	int te = 1;
//	scanf("%d", &te);
	while(te--)
		test();
	return 0;
}