#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr)
#define FORS(x,plus,arr) for(auto x = begin(arr)+(plus); x != end(arr); ++x)
#define FORREV(x,plus,arr) for(auto x = (arr).rbegin()+(plus); x !=(arr).rend(); ++x)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define whatis(x) cerr << #x << " is " << (x) << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;

#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class L, class R> ostream& operator<<(ostream &os, map<L, R> P) { for(auto const &vv: P)os<<"("<<vv.first<<","<<vv.second<<")"; return os; }
template<class T> ostream& operator<<(ostream &os, set<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) { os<<"("<<P.first<<","<<P.second<<")"; return os; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //s.find_by_order(), s.order_of_key() <- works like lower_bound
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 2505

vector<pi> adj[N];
int dfs_num[N], dfs_min[N];
int wh[N];
vector<int> adj2[N];
vector<vector<int>> scc;
stack<int> st;
int it;

//Order of SCCs is a reverse topological sort of SCC Condensation-DAG
void tarjan(int cur){
    dfs_num[cur] = dfs_min[cur] = ++it;
    st.push(cur);
    for(auto &i: adj[cur]){
        if(!dfs_num[i.e1])
            tarjan(i.e1);
        dfs_min[cur] = min(dfs_min[cur], dfs_min[i.e1]);
    }
    if(dfs_num[cur] == dfs_min[cur]){
        scc.push_back({});
        int cr;
        do{
            //elements of the scc
            cr = st.top(); st.pop();
            dfs_min[cr] = 0x7f7f7f7f;
            wh[cr] = scc.size()-1;
            scc.back().push_back(cr);
        }while(cr != cur);
    }
}

bool reach[N];
bool rchscc[N];
bool vis[N];

void d1(int v){
    vis[v] = 1;
    FORR(i,adj2[v]){
        if(!vis[i])
            d1(i);
        rchscc[v] |= rchscc[i];
    }
}


int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,m,p;
    sc(n,m,p);
    while(m--){
        int f,s,w;
        sc(f,s,w);
        --f,--s;
        w -= p;
        adj[f].pb({s,w});
    }
    for(int i = 0; i < n; ++i){
        if(!dfs_num[i]){
            tarjan(i);
        }
    }
    int nn = scc.size();
    bool was[n];
    memset(was,0,n);
    int qu[n+1];
    int *quit = qu;
    for(int i = 0; i < nn; ++i){
        was[i] = 1;
        for(auto &x: scc[i]){
            for(auto &j: adj[x]){
                if(!was[wh[j.e1]]){
                    was[wh[j.e1]] = 1;
                    adj2[i].push_back(wh[j.e1]);
                    *++quit = wh[j.e1];
                }
            }
        }
        was[i] = 0;
        while(quit != qu){
            was[*quit--] = 0;
        }
    }
    rchscc[wh[n-1]] = 1;
    d1(wh[0]);
    FOR(i,0,nn){
        if(rchscc[i]){
            FORR(x,scc[i])
                reach[x] = 1;
        }
    }
    ll dist[n];
    memset(dist,127,n<<3);
    FORR(i,dist)
        i *= -1;
    dist[0] = 0;
    for(int i=0;i<=n;++i){
        for(int j=0;j<n;++j){
            for(auto const &e: adj[j]){
                if(dist[j] + e.second > dist[e.first]){
                    dist[e.first] = dist[j] + e.second;
                }
            }
        }
    }
    bool cont = false;
    FOR(i,0,n+1)
    for(int j=0;j<n;++j){
        for(auto const &e: adj[j]){
            if(dist[j] + e.second > dist[e.first]){
                dist[e.first] = dist[j] + e.second;
                //if on route to n then bad
                /* if(reach[e.first]) */
                /*     cont = true; */
                //xddd
                if(e.first == n-1){
                    cont = 1;
                }
            }
        }
    }
    /* FOR(i,0,n){ */
    /*     whatis(i) */
    /*     whatis(reach[i]) */
    /* } */
    if(cont) REE(-1)
    cout << max((ll)0,dist[n-1]) << '\n';
}



Measured memory_bytes: 896