#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 2;


void solve(){
    int N, M, C; cin >> N >> M >> C;
    vector<vector<tuple<int, int, int>>> G(N);
    for(int i=0; i<M; i++){
        int u, v, r, w; cin >> u >> v >> r >> w;
        u--; v--;
        G[u].pb({v, r, w});
        G[v].pb({u, r, w});
    }
    vector<vector<int>> dist(N, vector<int>(C+1, -1));
    for(int i=0; i<=C; i++){
        dist[N-1][i] = i;
        for(int v=0; v<N; v++)for(auto [to, r, w] : G[v]){
            int fee = i/r + w;
            if(i < fee) continue;
            dist[v][i] = max(dist[v][i], dist[to][i-fee]);
        }
    }

    for(int i=1; i<=C; i++) cout << dist[0][i] << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}