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
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;
const ll M = 1000LL * 1000LL * 1000LL + 7LL;
const int N = 1000 * 1000 + 7;
ll dis[N], nw[N];
pair<int, pair<int, ll>> tab[N];
bool vis[N];

void NK(int m)
{
    cout << 0 << "\n";
    for(int i = 1; i < m; ++i)
        cout << -1 << "\n";
}

void Solve()
{
    int n, m, k, cnt = 0;
    cin >> n >> k >> m;
    for(int i = 1; i <= m; ++i) dis[i] = I;
    for(int i = 1; i <= n; ++i)
        cin >> tab[i].st >> tab[i].nd.st >> tab[i].nd.nd;
    sort(tab + 1, tab + 1 + n);
    for(int j = 0; j < m; ++j) nw[j] = I + 1LL;
    for(int i = 1; i <= n; ++i)
    {
        tab[i].nd.st %= m;
        for(int j = 0; j < m; ++j)
        {
            int ne = j + tab[i].nd.st;
            if(ne >= m) ne -= m;
            nw[ne] = min(nw[ne], dis[j] + tab[i].nd.nd);
        }
        if(i == n || tab[i].st != tab[i + 1].st)
        {
            ++cnt;
            for(int j = 0; j < m; ++j)
                dis[j] = nw[j];
            for(int j = 0; j < m; ++j) nw[j] = I + 1LL;
        }
    }
    if(cnt != k)
    {
        NK(m);
        return;
    }
    dis[0] = 0;
    vis[0] = true;

    for(int i = 1; i < m; ++i)
    {
        ll mi = I + 1LL; int v = 1;
        for(int j = 1; j < m; ++j)
            if(!vis[j] && dis[j] < mi)
            {
                v = j;
                mi = dis[j];
            }
        vis[v] = true;
        for(int j = 1; j < m; ++j)
        {
            int ne = v + j;
            if(ne >= m) ne -= m;
            if(dis[v] + dis[j] < dis[ne])
                dis[ne] = dis[v] + dis[j];
        }
    }

    for(int i = 0; i < m; ++i)
        if(dis[i] >= I)
            cout << -1 << "\n";
        else
            cout << dis[i] << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}