#include <algorithm>
#include <bit>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <random>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <set>
#include <string>

using namespace::std;

template<typename T, typename U>
ostream& operator<< (ostream& o, const pair<T, U>& p) {
  o << "<" << p.first << ", " << p.second << ">";
  return o;
}

template <typename T>
ostream& operator<< (ostream& o, const vector<T>& v) {
 for (const auto& x : v) o << x << " ";
 return o;
}

template <typename T>
ostream& operator<< (ostream& o, const set<T>& v) {
 for (const auto& x : v) o << x << " ";
 return o;
}

template <typename T>
ostream& operator<< (ostream& o, const deque<T>& v) {
 for (const auto& x : v) o << x << " ";
 return o;
}

template <typename K, typename V>
ostream& operator<<(ostream& o, const unordered_map<K, V>& m) {
  o << "{";
  for (const auto& [k, v] : m)
    o << " " << k << ": " << v << ",";
  o << "}";
  return o;
}

template <typename T>
istream& operator>> (istream& i, vector<T>& v) {
  for (auto& x : v) i >> x;
  return i;
}

istream& operator>> (istream& i, pair<int, int>& p) {
  i >> p.first >> p.second;
  return i;
}



int main() {
  ios::sync_with_stdio(false);
  long long n, m, x;
  cin >> n >> m >> x;
  vector<vector<tuple<int, int, int>>> e(n + 1);
  for (int i = 0; i < m; ++i) {
    int u, v, a, b;
    cin >> u >> v >> a >> b;
    e[u].push_back({v, a, b});
    e[v].push_back({u, a, b});
  }
  const long long inf = 1e18 + 7;
  long long a = 0, b = 1e9+7;
  while (a <= b) {
    //cerr << " a " << a << " b " << b << endl;
    long long mid = (a + b) / 2;
    vector<long long> dis(n + 1, inf);
    set<pair<long long, int>> q {{0, 1}};
    while (q.size()) {
      auto [d, u] = *q.begin();
      q.erase(q.begin());
      //cerr << " d " << d << " u " << u << endl;
      if (dis[u] < inf) continue;
      dis[u] = d;
      for (auto [v, l, w] : e[u])
        if (mid <= w && dis[v] == inf)
          q.insert({d + l, v});
    }
    if (dis[n] > x) b = mid - 1;
    else a = mid + 1;
  }
  cout << b << endl;
  
  return 0;
}