#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll n,m,c;
    cin>>n>>m>>c;
    vector<vector<pair<ll,ll>>> g(n,vector<pair<ll,ll>>(n,make_pair(-1,-1)));
    for(int i = 0;i<m;i++){
        ll u,v,r,w;
        cin>>u>>v>>r>>w;
        u--;v--;
        pair<ll,ll> now = make_pair(r,w);
        g[u][v] = g[v][u] = now;
    }
    vector<vector<ll>> dp(n,vector<ll>(c+1,-1));
    dp[n-1][0] = 0;
    for(int i = 0;i<=c;i++) dp[n-1][i] = i;

    for(int i = 1;i<=c;i++){
        for(int j = 0;j<n;j++){
            for(int k = 0;k<n;k++){
                auto now = g[j][k];
                if(now.first==-1) continue;
                ll cost = i / now.first;
                cost += now.second;
                if(cost>i) continue;
                ll nj = i - cost;
                dp[j][i] = max(dp[j][i],dp[k][nj]);
            }
        }
    }
    for(int i = 1;i<=c;i++) cout<<dp[0][i]<<endl;
}