#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

template <int P>
class mod_int {
  using Z = mod_int;

private:
  static int mo(int x) { return x < 0 ? x + P : x; }

public:
  int x;
  int val() const { return x; }
  mod_int() : x(0) {}
  template <class T>
  mod_int(const T &x_) : x(x_ >= 0 && x_ < P ? static_cast<int>(x_) : mo(static_cast<int>(x_ % P))) {}
  bool operator==(const Z &rhs) const { return x == rhs.x; }
  bool operator!=(const Z &rhs) const { return x != rhs.x; }
  Z operator-() const { return Z(x ? P - x : 0); }
  Z pow(long long k) const {
    Z res = 1, t = *this;
    while (k) {
      if (k & 1) res *= t;
      if (k >>= 1) t *= t;
    }
    return res;
  }
  Z &operator++() {
    x < P - 1 ? ++x : x = 0;
    return *this;
  }
  Z &operator--() {
    x ? --x : x = P - 1;
    return *this;
  }
  Z operator++(int) {
    Z ret = x;
    x < P - 1 ? ++x : x = 0;
    return ret;
  }
  Z operator--(int) {
    Z ret = x;
    x ? --x : x = P - 1;
    return ret;
  }
  Z inv() const { return pow(P - 2); }
  Z &operator+=(const Z &rhs) {
    (x += rhs.x) >= P && (x -= P);
    return *this;
  }
  Z &operator-=(const Z &rhs) {
    (x -= rhs.x) < 0 && (x += P);
    return *this;
  }
  Z &operator*=(const Z &rhs) {
    x = 1ULL * x * rhs.x % P;
    return *this;
  }
  Z &operator/=(const Z &rhs) { return *this *= rhs.inv(); }
#define setO(T, o)                                 \
  friend T operator o(const Z &lhs, const Z &rhs) {\
    Z res = lhs;                                   \
    return res o## = rhs;                          \
  }
  setO(Z, +) setO(Z, -) setO(Z, *) setO(Z, /)
#undef setO
};
const int P = 998244353;
using Z = mod_int<P>;

const int maxn = 310;
const __int128 inf = 1e37;

int n, m;
ll k;

struct mat {
  __int128 a[maxn][maxn];
  friend mat operator*(mat x, mat y) {
    mat res;
    rep (i, 1, n) rep (j, 1, n) res.a[i][j] = inf;
    rep (i, 1, n) rep (k, 1, n) if (x.a[i][k] != inf) rep (j, 1, n) chkmn(res.a[i][j], x.a[i][k] + y.a[k][j]);
    return res;
  }
} e, res;

void print(__int128 x) {
  if (!x) return;
  print(x / 10);
  putchar('0' + x % 10);
}

void work() {
  scanf("%d%d%lld", &n, &m, &k);
  rep (i, 1, n) rep (j, 1, n) e.a[i][j] = inf;
  rep (i, 1, m) {
    int u, v;
    ll w;
    scanf("%d%d%lld", &u, &v, &w);
    chkmn(e.a[u][v], __int128(w));
  }
  rep (i, 1, n) rep (j, 1, n) res.a[i][j] = inf;
  res.a[1][1] = 0;
  while (k) {
    if (k & 1) res = res * e;
    e = e * e, k >>= 1;
  }
  rep (i, 1, n) {
    if (res.a[1][i] == inf) printf("-1 ");
    else print(res.a[1][i]), printf(" ");
  }
  printf("\n");
}

int main() {
  int sid, t;
  scanf("%d%d", &sid, &t);
  while (t--) work();
}