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
105
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) 42
#endif

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, n, m) for (int i = (n); i < (m); ++i)

#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define reppr(i, n, m) for (int i = (m) - 1; i >= (n); --i)

#define each(a,x) for(auto& a : (x))
#define sz(x) int((x).size())

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;

template <typename T, typename V> void mini(T& a, V b) {if (b < a) a = b; }
template <typename T, typename V> void maxi(T& a, V b) {if (b > a) a = b; }

const ll INF = 1e18;

void solve() {
    int types, cols, mod;
    cin >> types >> cols >> mod;

    vector<vector<pair<int, ll>>> vec(cols); // vec[col] = [(weight, price)]
    rep(_, types) {
        int k, m, c;
        cin >> k >> m >> c;
        vec[k-1].emplace_back(m % mod, c);
    }

    // debug(vec);

    vll dp(mod, INF);
    dp[0] = 0;

    auto add = [&](int a, int b) {
        a += b;
        return a >= mod ? a - mod : a;
    };

    for (auto &v : vec) {
        vll nextdp(mod, INF);

        for (auto [weight, price] : v)
            rep(oldmod, mod) if (dp[oldmod] != INF)
                mini(nextdp[add(oldmod, weight)], dp[oldmod] + price);

        swap(dp, nextdp);
    }

    // debug(dp);

    vll dist(mod, INF);
    dist[0] = 0;
    vi vis(mod);

    rep(_, mod) {
        int i = -1;

        rep(id, mod) if (!vis[id] && (i == -1 || dist[id] < dist[i]))
            i = id;
        assert(i != -1);

        vis[i] = true;
        rep(toadd, mod) if (dp[toadd] != INF && dist[i] != INF)
            mini(dist[add(toadd, i)], dist[i] + dp[toadd]);
    }

    for (ll val : dist) {
        if (val == INF) val = -1;
        cout << val << '\n';
    }
}

int main() {
#ifdef DEBUG
    const int MEMSIZE = 1024 * 1024 * 1024;
    static_assert(MEMSIZE % 16 == 0);
    static char stack[MEMSIZE];
    asm volatile (
        "mov %[newstack], %%rsp\n"
        "call *%[funcptr]"
        :: [funcptr] "r" (solve), [newstack] "r" (stack + MEMSIZE)
    );
    exit(0);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
#endif
}