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
// clang-format off
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ssize(x) int(x.size())
template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<'('<<p.first<<", "<<p.second<<')';}
template<typename T,typename = typename enable_if<!is_same<T,string>::value>::type>
auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<'}';}
#ifdef DEBUG
#define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n'
#else
#define debug(...) {}
#endif
// clang-format on

#define INF LONG_LONG_MAX / 2
vector<pair<int, int>> colors[7007];
ll dp[7111][7111];

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

    int n, k, m, kk, mm, c;
    cin >> n >> k >> m;
    for (int i = 0; i < n; i++)
    {
        cin >> kk >> mm >> c;
        colors[kk].push_back({mm % m, c});
    }

    for (int i = 1; i <= k; i++)
    {
        if (ssize(colors[i]) == 0)
        {
            cout << 0 << '\n';
            for (int j = 1; j < m; j++)
                cout << -1 << '\n';
            return 0;
        }
    }

    for (int i = 0; i < (k + 100); i++)
        for (int j = 0; j < m; j++)
            dp[i][j] = INF;
    dp[0][0] = 0;

    for (int i = 1; i <= k; i++)
    {
        for (auto t : colors[i])
        {
            for (int j = 0; j < m; j++)
            {
                dp[i][j] = min(dp[i][j], dp[i - 1][(j - t.first + m) % m] + t.second);
            }
        }
    }

    dp[k][0] = 0;
    int pos = k;

    for (ll it = 0; (1LL << it) <= m * 2; it++)
    {
        pos++;
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < m; j++)
            {
                dp[pos][i] = min(dp[pos][i], dp[pos - 1][j] + dp[pos - 1][(i - j + m) % m]);
            }
        }
    }

    for (int i = 0; i < m; i++)
    {
        if (dp[pos][i] == INF)
            cout << -1 << '\n';
        else
            cout << dp[pos][i] << '\n';
    }

    return 0;
}