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
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define pb emplace_back
#define ins insert
#define mp make_pair
#define ssize(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pld pair <ld, ld>
#define st first
#define nd second

using namespace std;
using ll = int_fast64_t;
// using lll = __int128_t;
using ld = long double;
const int oo = 1e9 + 7;
const ll ool = 1e18;
const int mod = 1e9 + 7;

void solve(){
    int n, m, k; cin >> n >> k >> m;
    vector <vector<pair<int, ll>>> tab(k);
    vector <ll> dp(m, ool);
    for(int i = 0; i < n; i ++){
        int ki, mi; ll ci; cin >> ki >> mi >> ci;
        mi %= m;
        -- ki;
        tab[ki].pb(mi, ci);
        if(!ki) dp[mi] = min(dp[mi], ci);
    }
    for(int i = 1; i < k; i ++){
        vector <ll> rn(m, ool);
        for(auto [mi, ci]: tab[i]){
            for(int j = 0; j < m; j ++) rn[j] = min(rn[j], dp[(j - mi + m) % m] + ci);
        }
        for(int j = 0; j < m; j ++){
            if(rn[j] < ool) dp[j] = rn[j];
            else dp[j] = ool;
        }
    }
    vector <ll> ans(m, ool), opt(m, ool);
    ans[0] = 0;
    opt[0] = 0;
    for(ll i = 1; i < m; i ++){
        if(dp[i] == ool) continue;
        for(ll j = 1; j <= m; j ++) opt[(i * j) % m] = min(opt[(i * j) % m], j * dp[i]);
    }
    for(int i = 1; i < m; i ++){
        if(opt[i] == ool) continue;
        auto rn = ans;
        for(int j = 0; j < m; j ++){
            rn[j] = min(ans[j], ans[(j - i + m) % m] + opt[i]);
        }
        ans = rn;
    }
    for(int i = 0; i < m; i ++){
        if(ans[i] == ool) cout << "-1\n";
        else cout << ans[i] << '\n';
    }
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t; t = 1;
    // cin >> t;
    while(t --) solve();
    return 0;
}