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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
namespace debug {
template <class c> struct rge { c b, e; };
template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; }
template <class c> char spk(...);
template <class c> auto spk(c *a) -> decltype(cerr << *a, 0);
struct stream {
  ~stream() { cerr << endl; }
  template <class c>
  typename enable_if<sizeof spk<c>(0) != 1, stream &>::type operator<<(c i) {
    cerr << boolalpha << i;
    return *this;
  }
  template <class c>
  typename enable_if<sizeof spk<c>(0) == 1, stream &>::type operator<<(c i) {
    return *this << range(begin(i), end(i));
  }
  template <class a, class b> stream &operator<<(pair<a, b> p) {
    return *this << "(" << p.first << ", " << p.second << ")";
  }
  template <class c> stream &operator<<(rge<c> d) {
    *this << "[";
    for (auto it = d.b; it != d.e; it++)
      *this << ", " + 2 * (it == d.b) << *it;
    return *this << "]";
  }
  stream &_dbg(const string &s, int i, int b) { return *this; }
  template <class c, class... cs>
  stream &_dbg(const string &s, int i, int b, c arg, cs... args) {
    if (i == (int)(s.size()))
      return (*this << ": " << arg);
    b += (s[i] == '(') + (s[i] == '[') + (s[i] == '{') - (s[i] == ')') -
         (s[i] == ']') - (s[i] == '}');
    return (s[i] == ',' && b == 0)
               ? (*this << ": " << arg << "     ")._dbg(s, i + 1, b, args...)
               : (s[i] == ' ' ? *this : *this << s[i])
                     ._dbg(s, i + 1, b, arg, args...);
  }
};
} // namespace debug
#ifdef DEBUG
#define dout debug::stream()
#define dbg(...)                                                               \
  ((dout << "line:" << __LINE__ << " >> ")                                     \
       ._dbg(#__VA_ARGS__, 0, 0, __VA_ARGS__))
#else
#define dout
#define dbg(...)
#endif
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

struct Item {
  int mass;
  int cost;

  friend ostream &operator<<(ostream &f, const Item &i) {
    f << "Item{ mass: " << i.mass << ", cost: " << i.cost << "}";
    return f;
  }
};

vector<vector<Item>> items;

struct Edge {
  int len;
  long long cost;

  friend ostream &operator<<(ostream &f, const Edge &e) {
    f << "Edge{ len: " << e.len << ", cost: " << e.cost << "}";
    return f;
  }
};

vector<Edge> edges;
const long long INF = 1e18;

void ComputeEdges(int k, int m) {
  array<vector<long long>, 2> dp;
  array<vector<bool>, 2> reachable;
  for (int i = 0; i < 2; i++) {
    dp[i].resize(m, INF);
    reachable[i].resize(m, false);
  }
  dp[0][0] = 0;
  reachable[0][0] = true;
  int curr_row = 0, next_row = 1;
  for (int color = 0; color < k; color++) {
    fill(dp[next_row].begin(), dp[next_row].end(), INF);
    fill(reachable[next_row].begin(), reachable[next_row].end(), false);
    for (const Item &item : items[color]) {
      for (int mass = 0; mass < m; mass++) {
        if (reachable[curr_row][mass]) {
          int new_mass = (mass + item.mass) % m;
          long long new_cost = dp[curr_row][mass] + item.cost;
          reachable[next_row][new_mass] = true;
          dp[next_row][new_mass] = min(dp[next_row][new_mass], new_cost);
        }
      }
    }
    swap(curr_row, next_row);
  }
  for (int mass = 0; mass < m; mass++) {
    if (reachable[curr_row][mass]) {
      edges.push_back({mass, dp[curr_row][mass]});
    }
  }
}

vector<bool> vis;
vector<long long> dist;

int FindMin(int m) {
  int min_index = -1;
  for (int i = 0; i < m; i++) {
    if (vis[i])
      continue;
    if (min_index == -1 || dist[i] < dist[min_index]) {
      min_index = i;
    }
  }
  return min_index;
}

void Dijkstra(int m) {
  vis.resize(m, false);
  dist.resize(m, INF);
  dist[0] = 0;
  for (int i = 0; i < m; i++) {
    int u = FindMin(m);
    if (u == -1 || dist[u] == INF)
      break;
    vis[u] = true;
    for (auto [l, c] : edges) {
      int v = (u + l) % m;
      long long new_dist = dist[u] + c;
      if (new_dist < dist[v]) {
        dist[v] = new_dist;
      }
    }
  }
}

int main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  int n, k, m;
  cin >> n >> k >> m;
  items.resize(k);
  for (int i = 0; i < n; i++) {
    int color, mass, cost;
    cin >> color >> mass >> cost;
    items[color - 1].push_back({mass, cost});
  }
  ComputeEdges(k, m);
  Dijkstra(m);
  for (int i = 0; i < m; i++) {
    if (!vis[i]) {
      cout << -1 << '\n';
    } else {
      cout << dist[i] << '\n';
    }
  }

  return 0;
}