import java.io.*;
import java.util.*;
import java.util.stream.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        long limit = sc.nextLong();
        ArrayList<ArrayList<Path>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }
        for (int i = 0; i < m; i++) {
            int a = sc.nextInt() - 1;
            int b = sc.nextInt() - 1;
            int c = sc.nextInt();
            int d = sc.nextInt();
            graph.get(a).add(new Path(b, c, d));
            graph.get(b).add(new Path(a, c, d));
        }
        int left = -1;
        int right = Integer.MAX_VALUE / 2;
        PriorityQueue<Path> queue = new PriorityQueue<>();
        long[] costs = new long[n];
        while (right - left > 1) {
            int mm = (left + right) / 2;
            queue.add(new Path(0, 0, mm));
            Arrays.fill(costs, Long.MAX_VALUE);
            while (queue.size() > 0) {
                Path p = queue.poll();
                if (costs[p.idx] <= p.value) {
                    continue;
                }
                costs[p.idx] = p.value;
                for (Path x : graph.get(p.idx)) {
                    if (x.width >= p.width) {
                        queue.add(new Path(x.idx, x.value + p.value, p.width));
                    }
                }
            }
            if (costs[n - 1] > limit) {
                right = mm;
            } else {
                left = mm;
            }
        }
        System.out.println(left);
    }
    
    static class Path implements Comparable<Path> {
        int idx;
        int value;
        int width;
        
        public Path(int idx, int value, int width) {
            this.idx = idx;
            this.value = value;
            this.width = width;
        }
        
        public int compareTo(Path another) {
            return value - another.value;
        }
    }
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}