#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repr(i,N) for(auto i = (N) - 1; i >= 0; i -= 1)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define vrep(v,it) for(auto it = v.begin(); it != v.end(); it++)
#define vrepr(v,it) for(auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
#define rand mtrand
using namespace std; void solve();
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector< vector<int> >;
constexpr int inf = 1001001001;
constexpr ll infLL = 0x1FFFFFFFFFFFFFFFLL;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(15);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cout << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cout << #v << " = "; array_out(v , N);cout << endl;} while(0)
  int main(){solve_dbg();}
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif

using P = pair<int,int>;
constexpr int MOD = 998244353;
random_device seed_gen; mt19937_64 mtrand(seed_gen());
//////////////////////////////////////////

template< typename T >
struct edge {
  int src, to;
  T cost;

  edge(int to) : src(-1) , to(to) , cost(0){}
  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

  edge &operator=(const int &x) { // edge e = n; とできる(e.to = n)
    to = x;
    return *this;
  }

  // int()をオーバーロードすることで重み付きグラフと普通のグラフでライブラリを共用できる
  operator int() const { return to; } // v[e]とできる ( v[e.to]に同じ )

};

// sort用 とりあえずcostの小さいほうが左としているが適宜書き換えて使いましょう
/**
template<typename T>
bool operator <(const edge<T>& e1,const edge<T>& e2){ 
  return e1.cost < e2.cost;
}//*/
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WG = vector< Edges< T > >;
template< typename T>
using UWG = vector< vector <int> >;

// ベルマンフォード法
// 負閉路がないときは配列Aにsからの最短距離を格納してtrueを返す
// 負閉路があるときにfalseを返す 計算量 O(頂点数N * 辺の数E)
// s 始点 A メモ用ベクトル es 辺
// (Aはinfで初期化済　0<A.size()&&(点の数)<=A.size()が必要)
template<typename T , T UNIT>
bool bellman(int s, vector<T>& A, Edges<T>& es){
  int N = int(A.size());
  A[s] = 0;
  rep(i,N){
    bool update = false;
    for(auto &e : es){
      if(A[e.src] == UNIT) continue;
      update |= amin(A[e.to] , A[e.src] + e.cost);
    }
    if(!update) return true;
  }
  return false;
}

vvi g , h;
void dfs(vi &flg , vvi &graph , int cur){
  flg[cur] = 1;
  each(x , graph[cur]){
    if(flg[x] == 0) dfs(flg , graph , x);
  } 
}

void solve(){
  clock_t start = clock();
  ini(N,M,P);
  Edges<ll> es;
  g.resize(N);
  h.resize(N);
  rep(i , M){
    ini(a,b,c);
    a--; b--; c -= P;
    es.eb(a,b,-c);
    g[a].pb(b);
    h[b].pb(a);
  }
  vl A(N , infLL);
  bellman<ll , infLL>(0 , A , es);
  if(A[0] < 0) die(-1);
  vl B = A;

  do{
    bellman<ll , infLL>(0 , B , es);
    if(B[N - 1] != A[N - 1]) die(-1);
    vi fg(N , 0) , fh(N , 0);
    dfs(fg , g , 0);
    dfs(fh , h , N-1);
    //trc(fg , fh);
    rep(i,N){
      if(fg[i] && fh[i]){
        if(B[i] < A[i]) die(-1);
      }
    }
  }while( 0 /*clock() - start < 1800*/ );
  out(A[N-1] == infLL ? -1 : max(0LL , -A[N - 1]) );
  

}

Measured memory_bytes: 768