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
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<(int)b;++i)
#define FORD(i,a,b) for(int i=a;i>=(int)b;--i)
#define PB push_back
#define EB emplace_back
#define FI first
#define SE second
#define umap unordered_map
#define uset unordered_set
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vpii vector<pii>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ALL(X) (X).begin(),(X).end()
#ifndef DEBUG
#define endl (char)10
#endif
using namespace std;
using ll = long long;
using ld = long double;

template <class T>
istream& operator>> (istream& is, vector<T>& vec){
    FOR(i,0,vec.size()) is >> vec[i];
    return is;
}
template <class T>
ostream& operator<< (ostream& os, vector<T>& vec){
    for(auto& t : vec) os << t << " ";
    return os;
}
template<class T, class U>
ostream& operator<< (ostream& os, const pair<T, U>& p){
    os << p.FI << " " << p.SE;
    return os;
}
template<class T, class U>
istream& operator>> (istream& is, pair<T, U>& p){
    is >> p.FI >> p.SE;
    return is;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, k, m;
    cin >> n >> k >> m;
    vector<vpii> V(k);
    while(n--){
        int x, y, z;
        cin >> x >> y >> z;
        V[x - 1].EB(y, z);
    }
    FOR(i,0,k) if (V[i].empty()){
        FOR(j,0,m) cout << (j == 0) - 1 << endl;
        return 0;
    }
    vll dp(m, -1);
    dp[0] = 0;
    vll dp2(m);
    FOR(i,0,k){
        FOR(j,0,m) dp2[j] = -1;
        for(const auto& p : V[i]){
            FOR(j,0,m) if (dp[j] != -1){
                int nm = (j + p.FI) % m;
                ll nc = dp[j] + p.SE;
                if (dp2[nm] == -1 || dp2[nm] > nc) dp2[nm] = nc;
            }
        }
        swap(dp, dp2);
    }
    vll M(m, -1);
    M[0] = 0;
    FOR(i,1,m) {
        if (dp[i] == -1) continue;
        FOR(j,1,m){
            int mm = (i * j) % m;
            ll mc = dp[i] * j;
            if (M[mm] == -1 || M[mm] > mc) M[mm] = mc;
        }
    }
    FOR(i,1,m){
        if (M[i] == -1) continue;
        FOR(j,1,m){
            if (M[j] == -1) continue;
            ll nc = M[i] + M[j];
            int nm = (i + j) % m;
            if (M[nm] == -1 || M[nm] > nc) M[nm] = nc;
        }
    }
    FOR(i,0,m) cout << M[i] << endl;
}