#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, C;
  cin >> n >> m >> C;
  vector<vector<tuple<int, int, int>>> to(n);
  rep(_, m) {
    int i, j, r, w;
    cin >> i >> j >> r >> w;
    i--, j--;
    to[i].emplace_back(j, r, w);
    to[j].emplace_back(i, r, w);
  }
  priority_queue<P> q;
  for (int c0 = 1; c0 <= C; c0++) {
    while (!q.empty()) q.pop();
    int dp[10]{};
    rep(i, 10) dp[i] = -1;
    dp[0] = c0;
    q.emplace(c0, 0);
    while (q.size()) {
      auto [c, u] = q.top(); q.pop();
      if (u == n - 1) break;
      if (dp[u] != c) continue;
      for (auto [v, r, w] : to[u]) {
        int nc = c - (c / r + w);
        if (chmax(dp[v], nc)) q.emplace(nc, v);
      }
    }
    cout << dp[n - 1] << '\n';
  }
}