#include #include #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<(int)n;++i) #define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)n-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif using namespace std; using namespace atcoder; using ll=long long; using pii=pair; using pll=pair; using pdd=pair; using veci=vector; using vecpii=vector>; using vecll=vector; using vecpll=vector>; using vecpdd=vector>; using vecs=vector; using vecb=vector; using vecd=vector; using tp=tuple; using tpll=tuple; using mint=modint998244353; using mint10=modint1000000007; template istream& operator>>(istream& in, pair& a){return in >> a.first >> a.second;} template ostream& operator<<(ostream& out, const pair& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template ostream& operator<<(ostream& out, const vector& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << ' '; return out;} template pair operator+(const pair& a, const pair& b){return {a.fi + b.fi, a.se + b.se};} template pair operator-(const pair& a, const pair& b){return {a.fi - b.fi, a.se - b.se};} template inline bool chmax(T& a,T b){if(a inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} constexpr ll INF=numeric_limits::max() / 4; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template void LogOutput(vector>& data){for(auto d : data) LogOutput(d);} int n; vector> g; priority_queue> q; ll dist[200000]; ll x; bool f(int k){ q.emplace(0, 0); rep(i, n) dist[i] = INF; dist[0] = 0; while(q.size()){ auto [c, v] = q.top(); q.pop(); for(auto [nv, nc, h] : g[v]) if(h >= k){ if(chmin(dist[nv], dist[v] + nc)) q.emplace(dist[nv], nv); } } return dist[n - 1] <= x; } int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int m;cin>>n>>m>>x; g.resize(n); rep(i, m){ int a, b, c, d;cin>>a>>b>>c>>d; a--, b--; g[a].emplace_back(b, c, d); g[b].emplace_back(a, c, d); } int l = 0, r = 1e9 + 1; while(r - l > 1){ int mid = (l + r) / 2; if(f(mid)) l = mid; else r = mid; } if(l == 0) l = -1; cout<