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

#define mp make_pair
#define pb push_back
// #define st first
#define nd second
#define fi first
#define se second
#define vt vector
#define FOR(a, b, c)  for(int a=b; a<c; ++a)
#define all(a)     (a).begin(),(a).end()
#define sz(a)      (int)(a).size()

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<int> vi; 
typedef vector<ll> vll;
typedef pii PII;
typedef pll PLL;

constexpr ll nax = 7969, INF = 1e18+2137;
constexpr ld eps = 1e-9;

mt19937_64 rng(6969);
// mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

inline ll rand(ll l, ll r) {
	return uniform_int_distribution<ll>(l, r)(rng);
}

int n, k, m; 
vector<pll> colors[nax]; 
ll batch_dp[nax][nax]; 
ll changes[nax], ans[nax]; 


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

    scanf("%d%d%d", &n, &k, &m); 
    for(int i = 0; i < n; i++) {
        ll a, b, c; 
        scanf("%lld%lld%lld", &a, &b, &c); 
        colors[a].pb(mp(b, c)); 
    }
    for(int i = 0; i <= k+1; i++) {
        for(int j = 0; j <= m; j++) {
            batch_dp[i][j] = INF; 
        }
    }

    batch_dp[0][0] = 0; 

    for(int i = 1; i <= k; i++) {
        for(auto e: colors[i]) {
            ll weight = e.fi; 
            ll price = e.se; 

            for(int j = 0; j < m; j++) {
                int cur = (j + weight); 
                if(cur >= m)
                    cur -= m; 
                batch_dp[i][cur] = min(batch_dp[i][cur], batch_dp[i-1][j] + price); 
            }
        }
    }

    // puts("batch dp:"); 
    // for(int i = 1; i <= k; i++) {
    //     for(int j = 0; j < m; j++) {
    //         printf("%lld ", (batch_dp[i][j] == INF ? -1 : batch_dp[i][j])); 
    //     }
    //     puts("");  
    // }

    for(int i = 0; i <= m; i++) {
        changes[i] = INF; 
    }
    changes[0] = 0; 

    for(int i = 1; i < m; i++) {
        if(batch_dp[k][i] == INF) 
            continue; 
        for(int j = 1; j < m; j++) {
            changes[(j * i) % m] = min(changes[(j * i) % m], j * batch_dp[k][i]); 
        }
    }

    // puts("changes"); 
    // for(int i = 0; i < m; i++) 
    //     printf("%lld ", changes[i] == INF ? -1 : changes[i]); 
    // puts(""); 

    for(int i = 0; i <= m; i++) 
        ans[i] = INF; 
    ans[0] = 0; 

    for(int i = 1; i < m; i++) {
        if(changes[i] == INF)
            continue; 
        for(int j = 0; j < m; j++) {
            int cur = (j + i); 
            if(cur >= m)
                cur -= m; 
            ans[cur] = min(ans[cur], ans[j] + changes[i]); 
        }
    }

    for(int i = 0; i < m; i++) {
        printf("%lld\n", ans[i] == INF ? -1 : ans[i]); 
    }
    // puts(""); 

    return 0;
}