#include <bits/stdc++.h>
using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int,int,int> tpl;

#define ALL(a)  (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)

#define en "\n"

const double EPS = 1e-9;
const double PI  = acos(-1.0);
const int INF = 2147483647;
const long long LINF = 1LL<<60;
const long long MOD = 1000000007; // 998244353

#define CLR(a) memset((a), 0, sizeof(a))

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

template<typename T>
struct Node{
    int id;
    T v;
    bool done = false;
    Node(int id, T v=1e15): id(id), v(v) {}
    Node(): id(0), v(1e15) {}
};

template<typename T>
struct Edge{
    int from, to, id;
    T cost;
    Edge(int from, int to, T cost=1, int id=-1): from(from), to(to), cost(cost), id(id) {}
};

template<typename T>
struct Graph{
    int N;
    vector<vector<Edge<T>>> adj;
    vector<Node<T>> node;
    vector<pair<int,int>> i2e; // 辺番号から辺への変換

    Graph(int N): N(N) {
        adj.assign(N, vector<Edge<T>>());
        node.assign(N, Node<T>());
        for(int i=0; i<N; ++i) node[i].id = i;
    }

    Graph() {}

    void add_edge(int i, int j, T cost=1, int id=-1){
        Edge<T> e(i, j, cost, id);
        if(id != -1) i2e.emplace_back(i, adj[i].size());
        adj[i].emplace_back(e);
    }

    vector<Edge<T>> get_adj(Node<T> node){
        return adj[node.id];
    }

    void assign(int n){
        N = n;
        adj.assign(N, vector<Edge<T>>());
        node.assign(N, Node<T>());
        for(int i=0; i<N; ++i) node[i].id = i;
    }

    void reset(){
        for(int i=0; i<N; ++i){
            node[i].done = false;
            node[i].v = 1e15;
        }
    }
};

int main(void){
    ll N,M,P; cin >> N >> M >> P;
    Graph<ll> G(N);
    REP(i,M){
        int A,B; ll C; cin >> A >> B >> C; A--; B--;
        G.add_edge(A,B,P-C,i);
    }

    G.node[0].v = 0;
    for(int i=0; i<N; i++)
        for(int j=0; j<M; j++){
            pair<int,int> p = G.i2e[j];
            Edge<ll> e = G.adj[p.first][p.second];
            if(G.node[e.from].v == 1e15) continue;
            chmin(G.node[e.to].v, G.node[e.from].v + e.cost);
        }

    ll ans = max((ll)0, -G.node[N-1].v);

    vector<bool> negative(N,false);
    for(int i=0; i<N; i++)
        for(int j=0; j<M; j++){
            pair<int,int> p = G.i2e[j];
            Edge<ll> e = G.adj[p.first][p.second];
            if(G.node[e.from].v == 1e15) continue;
            if(chmin(G.node[e.to].v, G.node[e.from].v + e.cost)){
                negative[e.to] = true;
            }
            if(negative[e.from]) negative[e.to] = true;
        }

    if(negative[N-1]) ans = -1;
    cout << ans << endl;
    return 0;
}

Measured memory_bytes: 640