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
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000000000000007LL

using namespace std;

int n, m, k, c, w, p;
long long koszt[7007], pre[7007], res[7007];
vector <pair<int, pair<int, int>>> v;
vector <pair<int, long long>> moves;

void dijkstra()
{
    priority_queue <pair<long long, int>, vector <pair<long long, int>>, greater <pair<long long, int>>> pq;
    pq.push({0, 0});
    res[0] = 0;

    while(!pq.empty())
    {
        int nr = pq.top().ss;
        long long r = pq.top().ff;
        pq.pop();
        //cout << "tera " << nr << " z wynikiem " << r << '\n';
        
        if(r > res[nr])
            continue;

        for(auto el : moves)
        {
            int nr2 = (nr + el.ff)%m;
            long long r2 = res[nr] + el.ss;
            if(r2 < res[nr2])
            {
                res[nr2] = r2;
                pq.push({r2, nr2});
            }
        }
    }
}

int solve()
{
    cin >> n >> k >> m;
    forr(i, n)
    {
        cin >> c >> w >> p;
        v.PB({c, {w, p}});
    }
    sort(v.begin(), v.end());

    forr(i, m)
    {
        koszt[i] = INF;
        res[i] = INF;
    }
    int last_c = 0;
    koszt[0] = 0;
    for(auto el : v)
    {
        w = el.ss.ff;
        c = el.ss.ss;
        if(el.ff == last_c+1)
        {
            last_c++;
            forr(i, m)
            {
                pre[i] = koszt[i];
                koszt[i] = INF;
            }
        }
        forr(i, m)
            koszt[(i+w)%m] = min(koszt[(i+w)%m], pre[i] + c);
    }
    //cout << last_c << '\n';
    forr(i, m)
    {
        if(last_c == k && koszt[i] < INF)
            moves.PB({i, koszt[i]});
        //cout << i << ": " << koszt[i] << '\n';
    }

    dijkstra();

    forr(i, m)
        cout << (res[i] < INF ? res[i] : -1) << '\n';


    return 0;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}