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
123
124
125
126
127
128
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define INF 1000000000
#define INFl 1000000000000000000
#define all(x) x.begin(), x.end()
#define sajz(x) (int)x.size()
#define pb push_back
#define se second
#define fi first
#define yes puts("YES")
#define no puts("NO")
#define erase_duplicates(x) {sort(all(x));(x).resize(distance((x).begin(), unique(all(x))));}
using namespace std;
//using namespace __gnu_pbds;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int ll

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef set<int> si;
typedef multiset<int> msi;
typedef long double ld;
//typedef cc_hash_table<int, int, hash<int>> ht;

const int MX = 7005;

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

    int n, k, m;
    cin >> n >> k >> m;

    vector<vector<pii>> cukierek(k);

    for (int i = 0; i < n; i ++) {
        int kolor, masa, cena;
        cin >> kolor >> masa >> cena;
        kolor --;
        cukierek[kolor].pb({masa, cena});
    }

    vi sz(k);
    for (int i = 0; i < k; i ++) sz[i] = sajz(cukierek[i]);

    vector<vector<vector<int>>> dp(k, vector<vector<int>>(m, vi(m, INFl)));

    for (int i = 0; i < k; i ++) {
        dp[i][0][0] = 0;
        for (auto c : cukierek[i]) {
            for (int cnt = 0; cnt < m - 1; cnt ++) {
                for (int M = 0; M < m; M ++) {
                    int nM = (M + c.first) % m;
                    int ncnt = cnt + 1;
                    dp[i][nM][ncnt] = min(dp[i][nM][ncnt], dp[i][M][cnt] + c.second);
                }
            }
        }   
    }

    vector<vector<vector<int>>> ans(k+1, vector<vector<int>>(m, vector<int>(m, INFl)));
    for (int i = 0; i < m; i ++) ans[0][i][0] = 0;

    for (int cnt = 0; cnt < m; cnt ++) {
        vector<vector<pii>> coins(k);
        for (int i = 0; i < k; i ++) {
            for (int M = 0; M < m; M ++) {
                if (dp[i][M][cnt] < INFl) coins[i].pb({M, dp[i][M][cnt]});
            }
        }

        debug(cnt, coins);

        for (int i = 0; i < k; i ++) {
            vector<int> pom = ans[i+1][cnt];
            for (auto c : coins[i]) {
                for (int M = 0; M < m; M ++) {
                    int nM = (M + c.first) % m;
                    pom[nM] = min(pom[nM], ans[i][cnt][M] + c.second);
                }
            }
            ans[i+1][cnt] = pom;
        }
    }

    for (int M = 0; M < m; M ++) {
        int res = INFl, ile = -1;
        for (int cnt = 0; cnt < m; cnt ++) {
            if (ans[k][cnt][M] < res) {
                res = ans[k][cnt][M];
                ile = cnt;
            }
        }
        cout << (res == INFl ? -1 : res) << '\n';
    }
    return 0;
}