#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <iomanip>
#include <climits>
#include <cmath>
#include <functional>
#include <numeric>
#include <regex>
#include <array>
#include <fstream>
#include <sstream>

//#include<atcoder/modint>
//using namespace atcoder;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repl(i,l,r) for (int i = l; i < (int)(r); i++)
#define all(a) a.begin(),a.end()
#define Pii pair<int,int>
#define Pll pair<long,long>
#define INFi 1000000001
#define INFl 1000000000000000001
#define ll long long
using namespace std;



template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T> void printArray(vector<T>&A){
    for(T&a:A){
        cout<<a<<" ";
    }
    cout<<endl;
}
template<class T> void printArrayln(vector<T>&A){
    for(T&a:A){
        cout<<a<<endl;
    }
}


template<class T1,class T2> std::ostream &operator<<(std::ostream &out, const pair<T1,T2> &A){
    cout<<"{"<<A.first<<","<<A.second<<"}";
    return out;
}

template<class T1,class T2> std::ostream &operator<<(std::ostream &out, const map<T1,T2> &M){
    for(const auto&A:M){
        cout<<"{"<<A.first<<","<<A.second<<"}";
    }
    return out;
}

template<class T1> std::ostream &operator<<(std::ostream &out, const set<T1> &M){
    cout<<"{";
    for(const auto&A:M){
        cout<<A<<", ";
    }
    cout<<"}"<<endl;
    return out;
}


template<class T1> std::ostream &operator<<(std::ostream &out, const multiset<T1> &M){
    cout<<"{";
    for(const auto&A:M){
        cout<<A<<", ";
    }
    cout<<"}"<<endl;
    return out;
}

template<class T> std::ostream &operator<<(std::ostream &out, const vector<T> &A){
    for(const T &a:A){
        cout<<a<<" ";
    }
    return out;
}

void print() { cout << endl; }
 
template <typename Head, typename... Tail>
void print(Head H, Tail... T) {
  cout << H << " ";
  print(T...);
}


template<class T> std::istream &operator>>(std::istream &in,vector<T>&A){
    for(T&a:A){
        std::cin>>a;
    }
    return in;
}

struct Edge{
    int to;
    long cost;
    long time;
};

using Graph = vector<vector<Edge>>;

struct State{
    int v;
    long cost;
    long time;
    bool operator>(const State &s) const{
        if(time==s.time){
            return cost<s.cost;
        }
        return time>s.time;
    }
};

int main(void){
    std::cin.tie(0)->sync_with_stdio(0);
    int N,M,X;cin>>N>>M>>X;
    Graph G(N);
    rep(i,M){
        int a,b,c,t;cin>>a>>b>>c>>t;
        a--;b--;
        G[a].push_back({b,c,t});
        G[b].push_back({a,c,t});
    }
    
    priority_queue<State,vector<State>,greater<State>> pq;

    pq.push({0,0,0});
    vector<State> dist(N,{0,INFl,INFl});
    dist[0]={0,0,0};
    int cnt = 0;
    while(!pq.empty() && cnt < 300000){
        State s=pq.top();pq.pop();
        if(s.v == N-1){
            break;
        }
        for(Edge e:G[s.v]){
            cnt++;
            long t = s.time+e.time;
            long m = s.cost - e.cost;            
            if(m<0){
                // お金が足りない
                long m2 = abs(m); //あとm円足りない
                long h = (m2+X-1)/X; //h時間働いてm円稼ぐ
                t+=h;
                m+=h*X;
            }
            State next = {e.to,m,t};
            if(dist[e.to]>next){
                dist[e.to]=next;
                pq.push(next);
            }
        }
    }
    if(dist[N-1].time==INFl){
        cout<<-1<<endl;
    }else{
        cout<<dist[N-1].time<<endl;
    }
}

/*
5 6 10
1 3 7 2
4 1 2 5
3 4 1 3
2 3 5 4
4 5 6 8
2 5 4 1


9
*/