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

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

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

vector<double> dijkstra(int N, vector<vector<Edge>> &graph) {
  vector<double> distance(N, INF);
  priority_queue<pair<double, int>,
                 vector<pair<double, int>>,
                 greater<pair<double, int>>> q;
  distance[0] = 0;
  q.push({0, 0});
  while (!q.empty()) {
    pair<double, int> p = q.top();
    q.pop();
    double path_now = p.first;
    int p_now = p.second;
    for (Edge e : graph[p_now]) {
      double 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, (double)C/X + T});
    g[v].push_back({u, (double)C/X + T});
  }
  vector<double> s = dijkstra(N, g);
  if (s[N-1] < INF)
    cout << (ll)(s[N-1] + (1 - 1e-10)) << endl;
  else
    cout << -1 << endl;
  return 0;
}