#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn solve() {
    let (n,m,p) = get!(usize, usize, isize);
    let abc = get!(usize, usize, isize; m);

    let mut nodes = vec![Vec::new(); n+1];
    for (a,b,c) in abc {
        nodes[a].push((b,c-p));
    }
    
    let mut vals = vec![-1_000_000_000; n+1];
    vals[1] = 0;
    for _ in 0..n-1 {
        for j in 1..n+1 {
            for &(ind, val) in &nodes[j] {
                vals[ind] = max!(vals[ind], vals[j] + val);
            }
        }
    }
    let mut reachable = vec![false; n+1];
    let mut queue = VecDeque::new();
    let mut visited = vec![false; n+1];
    reachable[1] = true;
    visited[1] = true;
    queue.push_back(1);
    while let Some(node) = queue.pop_front() {
        for &(next, _) in &nodes[node] {
            if visited[next] {
                continue;
            }
            visited[next] = true;
            reachable[next] = true;
            queue.push_back(next);
        }
    }

    let mut visited = vec![false; n+1];
    for j in 1..n+1 {
        for &(ind, val) in &nodes[j] {
            if vals[ind] < vals[j] + val && reachable[ind] {
                queue.push_back(j);
                visited[j] = true;
            }
        }
    }
    while let Some(node) = queue.pop_front() {
        for &(next, _) in &nodes[node] {
            if visited[next] {
                continue;
            }
            visited[next] = true;
            queue.push_back(next);
        }
    }

    if visited[n] {
        println!("-1");
    } else {
        println!("{}", max!(0,vals[n]));
    }
}


Measured memory_bytes: 8572