#include <bits/stdc++.h>
using namespace std;
typedef long long i64; 
const i64 INF = 1e18; 

inline void ckmin(i64 &x, i64 k) { x = (x < k ? x : k); }

int n, k, m; 
vector<pair<int, int>> a[7005]; 
i64 dp[7005][7005]; // 凑出 j 的体积需要的最小代价
i64 f[7005]; 

int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n >> k >> m;    
    while (n--) {
        int ki, mi, ci; cin >> ki >> mi >> ci; mi %= m; 
        a[ki].emplace_back(mi, ci); 
    }
    memset(dp, 0x3f, sizeof dp); 
    dp[0][0] = 0; 
    for (int i = 1; i <= k; ++i)
        for (auto [w, v] : a[i])
            for (int j = 0; j < m; ++j)
                ckmin(dp[i][(j + w) % m], dp[i - 1][j] + v); 
    
    memset(f, 0x3f, sizeof f); f[0] = 0; 
    for (int i = 1; i < m; ++i)
        for (int j = 0, lim = __gcd(i, m); j < lim; ++j)
            for (int t = j, c = 0; c < 2; c += t == j) {
                int p = (t + i) % m; 
                ckmin(f[p], f[t] + dp[k][i]); t = p; 
            }

    for (int i = 0; i < m; ++i)
        cout << (f[i] < INF ? f[i] : -1) << "\n"; 
    return 0;
}