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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
#include <climits>
using namespace std;
 
using ll = long long;
using ul = unsigned long long;
using db = long double;
using pi = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pi>;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define x first
#define y second

template<class T> using V = vector<T>; 
template<class T, size_t SZ> using AR = array<T,SZ>; 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define each(a,x) for (auto& a: x)
 
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define per(i,a,b) for(int i = (b) - 1; i >= (a); i--)

#ifdef LOCAL 
template<class A, class B> auto& operator<<(auto &o, pair<A, B> p) { return o << '(' << p.x << ", " << p.y << ')'; }
auto& operator<<(auto& o, auto a) {
    o << "{";
    for (auto b : a) o << b << ", ";
    return o << "}";
}
void dump(auto... x) { ((cerr << x << ", "), ...) << "\n"; }
#define debug(x...) cerr << "[" #x "]: ", dump(x)
#else
#define debug(...) ;
#endif

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template<class T> int lwb(V<T>& a, const T& b) { return int(lb(all(a),b)-bg(a)); }
template<class T> int upb(V<T>& a, const T& b) { return int(ub(all(a),b)-bg(a)); }
template<class T> void remDup(vector<T>& v) { sort(all(v)); v.erase(unique(all(v)),end(v)); }

constexpr ll INF = 1e18;

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);

    int n, k, m;
    cin >> n >> k >> m;
    vector<vpi> with_color(k);

    rep(_,0,n) {
        int i, w, c;
        cin >> i >> w >> c;
        i--;
        with_color[i].eb(w, c);
    }

    vl dp_prv;
    vl dp_cur(m, INF);
    dp_cur[0] = 0;

    rep(i,0,k) {
        dp_prv = dp_cur;
        fill(all(dp_cur), INF);
        for (auto [w, c] : with_color[i]) {
            rep(j,0,m) {
                ckmin(dp_cur[(j + w) % m], dp_prv[j] + c);
            }
        }
    }

    dp_cur[0] = 0;
    
    int iter = 0;
    while (true) {
        iter++;
        dp_prv = dp_cur;
        vector<pair<int, ll>> items;
        rep(i,0,m) if (dp_cur[i] != INF) {
            items.eb(i, dp_cur[i]);
        }
        rep(i,0,sz(items)) {
            auto [wi, ci] = items[i];
            rep(j,i,sz(items)) {
                auto [wj, cj] = items[j];
                ckmin(dp_cur[(wi + wj) % m], ci + cj);
            }
        }
        if (dp_prv == dp_cur) break;
    }

    for (auto x : dp_cur) cout << (x == INF ? -1 : x) << '\n';

    debug(iter);

    return 0;
}