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
 97
 98
 99
100
101
102
103
104
// clang-format off
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
template<class Fun>
class y_combinator_result {
    Fun fun_;
public:
    template<class T> explicit y_combinator_result(T &&fun): fun_(forward<T>(fun)) {}
    template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(ref(*this), forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<decay_t<Fun>>(forward<Fun>(fun)); }
// using namespace __gnu_pbds;
// template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef XOX
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; }
sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; }
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
struct { template <class T> operator T() { T x; cin >> x; return x; } } in;
#define endl '\n'
#define pb emplace_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using i64 = long long;
template <class T> using vt = vector<T>;
template <class T, size_t n> using ar = array<T, n>;
namespace R = ranges;
auto ra(auto x, auto y) { return R::iota_view(x, y); }
// #define int long long
// clang-format on

struct kiara {
    int rem, c;
};

void chmin(i64 &a, i64 b) { a = min(a, b); }

void solve() {
    int n = in, k = in, m = in;
    vt<vt<kiara>> grupy(k);
    for (int i = 0; i < n; i++) {
        int g = in, r = in, c = in;
        g--;
        grupy[g].pb(kiara{r, c});
    }
    const i64 oo = 1e18;
    vt<i64> dp(m, oo);
    dp[0] = 0;
    for (auto g : grupy) {
        vt<i64> new_dp(m, oo);
        for (int old_r : ra(0, m)) {
            for (auto [r, c] : g) {
                chmin(new_dp[(old_r + r) % m], dp[old_r] + c);
            }
        }
        dp = move(new_dp);
    }
    vt<i64> dist(m, oo);
    vt<bool> vis(m);
    auto put = [&](int x, i64 d) {
        if (dist[x] > d) dist[x] = d;
    };
    put(0, 0);
    for (int _ : ra(0, m)) {
        int x = -1;
        for (int i : ra(0, m)) {
            if (!vis[i] && (x == -1 || dist[i] < dist[x])) x = i;
        }
        vis[x] = 1;
        for (int i : ra(0, m)) {
            put((x + i) % m, dist[x] + dp[i]);
        }
    }
    replace(all(dist), oo, (i64)-1);
    for (int i : ra(0, m)) {
        cout << dist[i] << endl;
    }
}

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    // int t = in;
    while (t--) {
        solve();
    }
}