use proconio::input;
use std::cmp::min;

const INF: i32 = 1_000_000_000;

fn main() {
    input! {
        n: usize,
        c: usize,
        v: usize,
        s: [usize; v],
        t: [usize; v],
        y: [usize; v],
        m: [i32; v],
    }
    
    let mut graph = vec![vec![]; n];
    for i in 0..v {
        let from = s[i] - 1;
        let to = t[i] - 1;
        graph[from].push((to, y[i], m[i]));
    }
    
    let mut dp = vec![vec![INF; c + 1]; n];
    dp[0][c] = 0;
    
    for i in 0..n {
        for k in (0..=c).rev() {
            if dp[i][k] == INF {
                continue;
            }
            for &(to, cost, time) in &graph[i] {
                if k >= cost {
                    let new_k = k - cost;
                    dp[to][new_k] = min(dp[to][new_k], dp[i][k] + time);
                }
            }
        }
    }
    
    let result = *dp[n - 1].iter().min().unwrap();
    if result == INF {
        println!("-1");
    } else {
        println!("{}", result);
    }
}