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
#pragma GCC optimize("Ofast")
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
//typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define pss pair<short,short>
#define pld pair<long double,long double >
#define ld long double
#define piii  pair<pii,int>
#define vii vector<pair<int,int> >
#define st first
#define nd second
#define pll pair<ll,ll>
#define speed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define M_PI 3.14159265358979323846
//#define int long long
//const int mod=1000000007;
//const int mod=1009;
const int mod=998244353;
const int inf=1000000009;
const long long INF=1000000000000000009;
const long long big=1000000000000000;
const long double eps=0.000000000000000000001;
const int rozmiar=7005;
ll dp[rozmiar][rozmiar],dp2[rozmiar];
vii K[rozmiar];
bool O[rozmiar];
void solve()
{
    int n,k,m;
    cin>>n>>k>>m;
    for(int i=1;i<m;i++)
        dp[0][i]=INF,dp2[i]=INF;
    for(int i=1;i<=n;i++){
        int kolor,masa,cena;
        cin>>kolor>>masa>>cena;
        masa%=m;
        K[kolor].pb(mp(masa,cena));
    }
    for(int i=1;i<=k;i++){
        for(int j=0;j<m;j++)
            dp[i][j]=INF;
        for(auto el:K[i]){
            for(int j=0;j<m;j++){
                int poprzednik=(j-el.st+m)%m;
                dp[i][j]=min(dp[i][j],dp[i-1][poprzednik]+(ll)el.nd);
            }
        }
        /*for(int j=0;j<m;j++){
            cout<<dp[i][j]<<" ";
        }
        cout<<"\n";
        */
    }

    for(int i=1;i<=m;i++){
        ll mini=INF+5;
        int skad=-1;
        for(int j=0;j<m;j++){
            if(!O[j]&&dp2[j]<mini){
                mini=dp2[j];
                skad=j;
            }
        }
        O[skad]=1;
        for(int j=0;j<m;j++){
            int kto=(j+skad)%m;
            dp2[kto]=min(dp2[kto],dp2[skad]+dp[k][j]);
        }
    }

    for(int i=0;i<m;i++){
        if(dp2[i]==INF)
            cout<<"-1\n";
        else
            cout<<dp2[i]<<"\n";   
    }
}
    
int32_t main(){
    speed
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}