#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); ++(i))
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef complex<double> xy_t;

const lint mod = 1e9 + 7;

typedef struct UnionFindTree{
    vector<int> par;

    UnionFindTree(int n){
        par.resize(n, -1);
    }

    int find(int x){
        if(par[x] < 0) return x;
        return par[x] = find(par[x]);
    }

    int size(int x){
        return -par[find(x)];
    }

    bool unite(int x, int y){
        x = find(x);
        y = find(y);
        if(x == y) return false;
        if(size(x) < size(y)) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        return true;
    }

    bool same(int x, int y){
        return find(x) == find(y);
    }
}UF;

template<class T> struct edge{
    int from, to; T cost;
    edge(int f, int t, T c){
        from = f; to = t; cost = c;
    }
};

template<class T> struct Graph{
    vector<vector<edge<T>>> G;
    int n;

    Graph(int n_){
        n = n_;
        G.resize(n);
    }

    void add_edge(int f, int t, T c){
        G[f].emplace_back(f, t, c);
    }

    pair<bool, vector<T>> bellman_ford(int s){
        T INF = numeric_limits<T>::max();
        vector<T> d(n, INF);
        vector<edge<T>> E;
        rep(i, n)for(edge<T> &e: G[i]) E.push_back(e);
        d[s] = 0;
        rep(i, n)for(edge<T> &e: E){
            if(d[e.from] != INF && d[e.from] + e.cost < d[e.to]){
                d[e.to] = d[e.from] + e.cost;
                if(i == n-1) return make_pair(true, d);
            }
        }
        return make_pair(false, d);
    }

    vector<T> dijkstra(int s){
        using P = pair<T, int>;
        priority_queue<P, vector<P>, greater<P>> que;
        vector<T> d(n, numeric_limits<T>::max());
        d[s] = 0;
        que.push(P((T)0, s));
        while(!que.empty()){
            P p = que.top(); que.pop();
            int v = p.second;
            if(d[v] < p.first) continue;
            for(edge<T> &e : G[v]){
                if(d[e.to] > d[v] + e.cost){
                    d[e.to] = d[v] + e.cost;
                    que.push(P(d[e.to], e.to));
                }
            }
        }
        return d;
    }

    pair<bool, vector<vector<T>>> warshall_floyd(){
        T INF = numeric_limits<T>::max();
        vector<vector<T>> d = vector<vector<T>>(n, vector<T>(n, INF));
        rep(i, n){
            for(edge<T> &e: G[i]) d[i][e.to] = e.cost;
            d[i][i] = 0;
        }
        rep(k, n)rep(i, n)rep(j, n)if(d[i][k] < INF && d[k][j] < INF){
            d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
        }
        rep(i, n)if(d[i][i] < 0) return make_pair(true, d);
        return make_pair(false, d);
    }

    T kruskal(){
        vector<edge<T>> E;
        rep(i, n)for(edge<T> &e: G[i]) E.push_back(e);
        sort(E.begin(), E.end(), [](const edge<T> &e1, const edge<T> &e2){return e1.cost < e2.cost;});
        UF uf(n);
        T res = 0;
        for(edge<T> &e: E){
            if(!uf.same(e.from, e.to)){
                uf.unite(e.from, e.to);
                res += e.cost;
            }
        }
        return res;
    }

    vector<int> toposo(){
        vector<int> ret(n, -1), in(n, 0);
        rep(i, n)for(edge<T> &e: G[i]) ++in[e.to];
        int cur = 0;
        stack<int> st;
        rep(i, n)if(!in[i]) st.push(i);
        while(!st.empty()){
            int v = st.top(); st.pop();
            ret[cur++] = v;
            for(edge<T> &e: G[v]){
                --in[e.to];
                if(!in[e.to]) st.push(e.to);
            }
        }
        return ret;
    }

    void scc_dfs(int v, vector<bool> &used, vector<int> &vs){
        used[v] = true;
        for(edge<T> &e: G[v])if(!used[e.to]) scc_dfs(e.to, used, vs);
        vs.push_back(v);
    }

    void scc_rdfs(int v, int k, vector<int> &cmp, vector<bool> &used, vector<vector<int>> &rG){
        used[v] = true;
        cmp[v] = k;
        for(int nv: rG[v])if(!used[nv]) scc_rdfs(nv, k, cmp, used, rG);
    }

    pair<int, vector<int>> scc(){
        vector<vector<int>> rG(n);
        rep(i, n)for(edge<T> &e: G[i]) rG[e.to].push_back(i);
        vector<bool> used(n, false);
        vector<int> vs;
        vector<int> cmp(n);
        rep(i, n)if(!used[i]) scc_dfs(i, used, vs);
        fill(used.begin(), used.end(), false);
        int k = 0;
        rrep(i, n)if(!used[vs[i]]) scc_rdfs(vs[i], k++, cmp, used, rG);
        return make_pair(k, cmp);
    }

    void reach_dfs(int v, vector<bool> &reach){
        if(reach[v]) return;
        reach[v] = true;
        for(auto &e: G[v]) reach_dfs(e.to, reach);
    }

    vector<bool> can_reach(int v){
        vector<bool> reach(n, false);
        reach_dfs(v, reach);
        return reach;
    }
};

int main(){
    int n, m;
    lint p;
    scanf("%d%d%lld", &n, &m, &p);

    Graph<lint> g(n);
    vector<edge<lint>> E;
    rep(i, m){
        int a, b;
        lint c;
        scanf("%d%d%lld", &a, &b, &c);
        g.add_edge(--b, --a, p-c);
        E.push_back(edge<lint>(a, b, p-c));
    }

    auto reach = g.can_reach(n-1);
    Graph<lint> h(n);
    rep(i, m)if(reach[E[i].from] && reach[E[i].to]){
        h.add_edge(E[i].from, E[i].to, E[i].cost);
    }

    auto bf = h.bellman_ford(0);
    printf("%lld\n", bf.fi ? -1 : max(0LL, -bf.se[n-1]));
}

Measured memory_bytes: 1024