#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    long long N,M,X; cin >> N >> M >> X;
    vector<vector<tuple<int,long long,long long>>> Graph(N);
    for(int i=0; i<M; i++){
        int u,v; cin >> u >> v;
        u--; v--;
        long long c,t; cin >> c >> t;
        Graph.at(u).push_back({v,c%X,t+c/X});
        Graph.at(v).push_back({u,c%X,t+c/X});
    }

    long long inf = 1e18;
    vector<bool> already(N);
    vector<pair<long long,long long>> dist(N,{inf,inf});
    priority_queue<tuple<long long,long long,int>,vector<tuple<long long,long long,int>>,greater<>> Q;
    dist.at(0) = {0,0}; Q.push({0,0,0});
    while(Q.size()){
        auto[T,C,pos] = Q.top(); Q.pop();
        if(already.at(pos)) continue;
        already.at(pos) = true;
        C *= -1;

        for(auto [to,c,t] : Graph.at(pos)){
            if(already.at(to)) continue;
            if(C < c){if(dist.at(to) > make_pair(T+t+1,c-C-X)) dist.at(to) = {T+t+1,c-C-X},Q.push({T+t+1,c-C-X,to});}
            else if(dist.at(to) > make_pair(T+t,c-C)) dist.at(to) = {T+t,c-C},Q.push({T+t,c-C,to});
        }
    }

    if(dist.at(N-1).first == inf) cout << -1 << endl;
    else cout << dist.at(N-1).first << endl;
}