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
#include <vector>
#include <iostream>
#include <sstream>
#include <math.h>
#include <sys/time.h>
#include <cstdlib>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <fstream>
#include <set>
#include <map>
#include <iomanip>
#include <queue>
#include <climits>

#define FOR(i,a,b)  for(__typeof(b) i=(a);i<(b);++i)
#define REP(i,a)    FOR(i,0,a)
#define FOREACH(x,c)   for(__typeof(c.begin()) x=c.begin();x != c.end(); x++)
#define ALL(c)      c.begin(),c.end()
#define CLEAR(c)    memset(c,0,sizeof(c))
#define SIZE(c) (int) ((c).size())

#define PB          push_back
#define MP          make_pair
#define X           first
#define Y           second

#define ULL         unsigned long long
#define LL          long long
#define LD          long double
#define II         pair<int, int>
#define DD         pair<double, double>
#define FF          pair<float,float>

#define VC	    vector
#define VI          VC<int>
#define VVI         VC<VI>
#define VVVI        VC<VVI>
#define VD          VC<double>
#define VS          VC<string>
#define VII         VC<II>
#define VVII        VC<VII>
#define VDD         VC<DD>
#define VFF         VC<FF>
#define VVD         VC<VD>
#define VVVD        VC<VVD>
#define VLL         VC<LL>
#define VULL         VC<ULL>

#define DB(a)       cerr << #a << ": " << a << endl;

using namespace std;

template<class T> void print(VC < T > v) {cerr << "[";if (SIZE(v) != 0) cerr << v[0]; FOR(i, 1, SIZE(v)) cerr << "," << v[i]; cerr << "]\n";}
template<class T> string i2s(T &x) { ostringstream o; o << x; return o.str(); }
VS split(string &s, char c = ' ') {VS all; int p = 0, np; while (np = s.find(c, p), np >= 0) {all.PB(s.substr(p, np - p)); p = np + 1;} if (p < SIZE(s)) all.PB(s.substr(p)); return all;}

int N,K,M;

#define INFTY (1ULL << 60)

VLL get_jelly1(VVII &jelly){
    VLL dp(M,INFTY);
    VLL dp2(M);
    dp[0] = 0;
    for(auto &J : jelly){
        REP(i,M) dp2[i] = INFTY;
        REP(i,M) 
            for(auto j : J)
                dp2[(i+j.X)%M] = min(dp2[(i+j.X)%M],dp[i]+j.Y);
        dp.swap(dp2);
    }
    return dp;
}

VLL dijkstra(VLL &jelly){
    VLL ret(M,INFTY);
    VI done(M,0);
    ret[0] = 0;
    set<II> Q;
    Q.insert(MP(0,0));
    while(!Q.empty()){
        II e = *(Q.begin());
        Q.erase(Q.begin());
        if (done[e.Y]) continue;
        done[e.Y] = 1;
        REP(i,M)
            if (ret[(e.Y+i)%M] > ret[e.Y]+jelly[i]){
                ret[(e.Y+i)%M] = ret[e.Y]+jelly[i];
                Q.insert(MP(ret[(e.Y+i)%M],(e.Y+i)%M));
            }
    }
    return ret;
}


int main(int argc, char *argv[]){
    cin >> N >> K >> M;
    VVII jelly(K);
    int k,m,c;
    REP(i,N){
        cin >> k >> m >> c;
        k--;
        jelly[k].PB(MP(m,c));
    }
    VLL jelly1 = get_jelly1(jelly);
    VLL minCost = dijkstra(jelly1);
    REP(i,M)
        if (minCost[i] >= INFTY) 
            cout << -1 << endl;
        else
            cout << minCost[i] << endl;
    return 0;
}