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
#include <bits/stdc++.h>
#include <bits/extc++.h>

using namespace std;
using namespace __gnu_pbds;

#define fwd(i,a,b) for(int i=(a); i<(b);i++)
#define rep(i,n) for(int i=0; i<(n);i++)
#define ford(i,a,b) for(int i=(a); i>(b);i--)

#define all(X) (X).begin(), (X).end()
#define sz(X)((int)(X).size())

#define st first
#define nd second

#define DEBUG
#ifdef DEBUG
template<typename T1, typename T2> auto& operator<<(ostream& out, const pair<T1, T2>& a) { return out << "(" << a.first << ", " << a.second << ")"; }
template<typename T, typename N> auto& operator<<(N& out, const T& a) { out << "{"; for (const auto& b : a) out << b << ", "; return out << "}"; }
template<typename... Args> void print(Args&&... args) { (cerr << ... << args) << "\n"; }
#define debug(x...) cerr << "[" #x "]: ", print(x)
#else
#define debug(...) ;
#endif

template<typename T>
using Tree = tree <T,  null_type,  less<T>,  rb_tree_tag,  tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll n, k, m;
    cin >> n >> k >> m;
    vector<vector<pair<ll,ll>>> tab(k);
    ll a, b, c;
    rep(_,n) {
        cin >> a >> b >> c;
        tab[a-1].emplace_back(make_pair(b,c));
    }

    vector<ll> cur(m,-1);
    cur[0] = 0;
    rep(j,k) {
        vector<ll> next(m,-1);
        for(auto [wi, price] : tab[j]) {
            rep(i,m) {
                if(cur[i]>-1) {
                    if(next[(i+wi)%m]==-1) next[(i+wi)%m] = cur[i]+price;
                    else next[(i+wi)%m] = min(next[(i+wi)%m], cur[i]+price);
                }
            }
        }
        cur = next;
    }
    cur[0] = 0;
    vector<ll> next(m,-1); next[0] = 0;
    fwd(i,1,m) {
        if(cur[i]==-1) continue;
        fwd(j,1,m) {
            if(next[(j*i)%m]==-1) next[(j*i)%m] = cur[i]*j;
            else next[(j*i)%m] = min(next[(j*i)%m], cur[i]*j);
        }
    }
    rep(i,m) cur[i] = (cur[i] == -1) ? next[i] : min(cur[i], next[i]);

    rep(i,m) {
        rep(j,m) {
            if(cur[j] != -1 && cur[(m+i-j)%m] != -1) {
                ll price = cur[j] + cur[(m + i - j) % m];
                cur[i] = (cur[i] == -1) ? price : min(cur[i], price);
            }
        }
    }
    rep(i,m) {
        rep(j,m) {
            if(cur[j] != -1 && cur[(m+i-j)%m] != -1) {
                ll price = cur[j] + cur[(m + i - j) % m];
                cur[i] = (cur[i] == -1) ? price : min(cur[i], price);
            }
        }
    }

    rep(i,m) cout << cur[i] << '\n';

    return 0;
}