#include <bits/stdc++.h>

// #define int int64_t

const int kMaxN = 7e3 + 5;

int n, k, m;
int64_t dis[kMaxN], val[kMaxN];
bool vis[kMaxN];
std::vector<std::pair<int, int>> vec[kMaxN];

void prework() {
  memset(val, 0x3f, sizeof(val));
  val[0] = 0;
  for (int i = 1; i <= k; ++i) {
    static int64_t tmp[kMaxN];
    std::fill_n(tmp, m, 1e18);
    for (auto [mm, c] : vec[i]) {
      for (int j = 0; j < m; ++j)
        tmp[(j + mm) % m] = std::min(tmp[(j + mm) % m], val[j] + c);
    }
    for (int j = 0; j < m; ++j) val[j] = tmp[j];
  }
}

void dijkstra() {
  memset(dis, 0x3f, sizeof(dis));
  dis[0] = 0;
  for (int c = 1; c <= m; ++c) {
    int u = -1;
    for (int i = 0; i < m; ++i)
      if (!vis[i] && (u == -1 || dis[i] < dis[u]))
        u = i;
    if (u == -1) break;
    vis[u] = 1;
    for (int i = 0; i < m; ++i) {
      int v = (u + i) % m;
      if (dis[v] > dis[u] + val[i]) {
        dis[v] = dis[u] + val[i];
      }
    }
  }
}

void dickdreamer() {
  std::cin >> n >> k >> m;
  for (int i = 1; i <= n; ++i) {
    int k, m, c;
    std::cin >> k >> m >> c;
    vec[k].emplace_back(m, c);
  }
  for (int i = 1; i <= k; ++i) {
    if (!vec[i].size()) {
      std::cout << "0\n";
      for (int j = 1; j < m; ++j) std::cout << "-1\n";
      return;
    }
  }
  prework(), dijkstra();
  for (int i = 0; i < m; ++i) std::cout << (dis[i] <= 1e17 ? dis[i] : -1) << '\n';
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}