#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> PP;
// #define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;i<=(n);++i)
#define RREP(i,n) for(ll i=(n)-1;i>=0;--i)
#define ORREP(i,n) for(ll i=(n);i>=1;--i)
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define GOODBYE do { cout << "-1" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl
#define debug true
#define debug2 false


int main(void){
    //cin.tie(nullptr);
    //ios::sync_with_stdio(false);
    
    ll N,M,X;
    cin >> N >> M >> X;
    vector<ll> U(M),V(M),C(M),T(M);
    REP(i,M){
        cin >> U[i] >> V[i] >> C[i] >> T[i];
        U[i]--;V[i]--;
    }
    
    vector<vector<array<ll,3>>> G(N);
    REP(i,M){
        G[U[i]].push_back({V[i],C[i],T[i]});
        G[V[i]].push_back({U[i],C[i],T[i]});
    }
    
    // かかる時間のマイナス、余剰資金、金、時間、頂点
    priority_queue<pair<array<ll,4>,ll>> Que;
    Que.push({{0,0,0,0},0});
    
    vector<array<ll,4>> cost(N,{-INF,-INF,INF,INF});
    cost[0] = {0,0,0,0};
    
    while(!Que.empty()){
        
        auto q = Que.top();
        Que.pop();
        
        array<ll,4> p = q.first;
        ll v = q.second;
        if(cost[v] > p)continue;
        
        // cout << "? " << p[0] MM p[1] MM p[2] MM p[3] << "  " << v << endl;
        
        for(array<ll,3> g:G[v]){
            ll u = g[0], c = g[1], t=g[2];
            // cout << "  " << u MM c MM t << endl;
            ll nc = cost[v][2]+c, nt = cost[v][3]+t;
            array<ll,4> ni = {-(nt+(nc+X-1)/X),((nc+X-1)/X)*X-nc,nc,nt};
            if(cost[u] < ni){
                cost[u] = ni;
                Que.push({cost[u],u});
            }
        }
        
    }
    
    // REP(i,N){
    //     cout << i << ": ";
    //     REP(j,4){cout << cost[i][j] << " ";}cout << endl;
    // }
    
    ll Ans = -cost[N-1][0];
    if(Ans==INF)Ans=-1;
    cout << Ans << endl;
    
    
    return 0;
    
}