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

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long int;
using pil = pair<int, ll>;
#define INF 1e18+7

struct Edge {
  int to;
  ll dist;
  Edge(int to, ll dist) : to(to), dist(dist) {}
};

vector<ll> dijkstra(int N, vector<vector<Edge>> &graph) {
  vector<ll> distance(N, INF);
  priority_queue<pair<int, ll>,
                 vector<pair<int, ll>>,
                 greater<pair<int, ll>>> q;
  distance[0] = 0;
  q.push({0, 0});
  while (!q.empty()) {
    pair<int, ll> p = q.top();
    q.pop();
    int path_now = p.first;
    ll p_now = p.second;
    for (Edge e : graph[p_now]) {
      ll path_new = path_now + e.dist;
      int p_new = e.to;
      if (path_new < distance[p_new]) {
	distance[p_new] = path_new;
	q.push({path_new, p_new});
      }
    }
  }
  return distance;
}

int main() {
  int N, M, X;
  cin >> N >> M >> X;
  vector<vector<Edge>> g(N);
  rep(i, M) {
    int u, v, C, T;
    cin >> u >> v >> C >> T;
    u--; v--;
    g[u].push_back({v, (ll)C + (ll)T*X});
    g[v].push_back({u, (ll)C + (ll)T*X});
  }
  vector<ll> s = dijkstra(N, g);
  if (s[N-1] < INF)
    cout << (s[N-1] + (X-1)) / X << endl;
  else
    cout << -1 << endl;
  return 0;
}