#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debugos cout
#define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}}
#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=decltype(l)();(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
    os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os; }
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
class MaiScanner {
    FILE* fp_;
public:
    inline MaiScanner(FILE* fp):fp_(fp){}
    template<typename T> void input_integer(T& var) noexcept {
        var = 0; T sign = 1;
        int cc = getc_x(fp_);
        for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
            if (cc == '-') sign = -1;
        for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
            var = (var << 3) + (var << 1) + cc - '0';
        var = var * sign;
    }
    inline int c() noexcept { return getc_x(fp_); }
    inline MaiScanner& operator>>(int& var) noexcept { input_integer<int>(var); return *this; }
    inline MaiScanner& operator>>(long long& var) noexcept { input_integer<long long>(var); return *this; }
    inline MaiScanner& operator>>(string& var) {
        int cc = getc_x(fp_);
        for (; !isvisiblechar(cc); cc = getc_x(fp_));
        for (; isvisiblechar(cc); cc = getc_x(fp_))
            var.push_back(cc);
        return *this;
    }
    template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
    FILE* fp_;
public:
    inline MaiPrinter(FILE* fp):fp_(fp){}
    template<typename T>
    void output_integer(T var) noexcept {
        if (var == 0) { putc_x('0', fp_); return; }
        if (var < 0)
            putc_x('-', fp_),
            var = -var;
        char stack[32]; int stack_p = 0;
        while (var)
            stack[stack_p++] = '0' + (var % 10),
            var /= 10;
        while (stack_p)
            putc_x(stack[--stack_p], fp_);
    }
    inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
    inline MaiPrinter& operator<<(int var) noexcept { output_integer<int>(var); return *this; }
    inline MaiPrinter& operator<<(long long var) noexcept { output_integer<long long>(var); return *this; }
    inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
    inline MaiPrinter& operator<<(const string& str) {
        const char* p = str.c_str();
        const char* l = p + str.size();
        while (p < l) putc_x(*p++, fp_);
        return *this;
    }
    template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);

class DGraphE {
public:
    using W_T = ll;
    struct Arc {
        int from, to;
        W_T value;
        Arc(int f = 0, int t = 0, W_T value = 0) :from(f), to(t), value(value) {}
        inline int pair(int _v) const { return _v == to ? from : to; }
    };
    size_t n;
    vector<vector<int>> vertex_to;
    vector<vector<int>> vertex_from;
    vector<Arc> arcs;

    DGraphE(int n = 1) :n(n), vertex_to(n), vertex_from(n) { }

    inline size_t size() const { return n; }
    void resize(size_t _n) { n = _n; vertex_to.resize(_n); vertex_from.resize(_n); }
    void connect(int from, int to, W_T val = 0) {
        vertex_to[(size_t)from].push_back((int)arcs
            .size());
        vertex_from[(size_t)to].push_back((int)arcs
            .size());
        arcs
            .emplace_back(from, to, val);
    }
};

class DGraph{
public:
    size_t n;
    vector<vector<int>> vertex_to;
    vector<vector<int>> vertex_from;
    
    DGraph(size_t n=1):n(n),vertex_to(n),vertex_from(n){}
    
    inline size_t size() const { return n; }
    void resize(size_t _n){ n = _n; vertex_to.resize(_n); vertex_from.resize(_n); }
    void connect(int from, int to){
        vertex_to[(size_t)from].emplace_back(to);
        vertex_from[(size_t)to].emplace_back(from);
    }
};

vector<int> dijkstraD(const DGraph& graph, int startIndex) {
    vector<int> dist(graph.size(), numeric_limits<int>::max());
 
    queue<pair<int, int>> que; // <dist, idx>
    que.emplace(0, startIndex);
    dist[startIndex] = 0;
 
    while (!que.empty()) {
        int d = que.front().first;
        int v = que.front().second;
        que.pop();
        if (dist[v] < d) continue;
 
        for (int u : graph.vertex_to[v])
            if (d + 1 < dist[u])
                que.emplace(dist[u] = d + 1, u);
    }
    return move(dist);
}

vector<DGraphE::W_T> bellmanFord(int n, const vector<DGraphE::Arc>& arcs, int start = 0) {
    using T = DGraphE::W_T;
    vector<T> dist(n, numeric_limits<T>::min()/2);
    dist[start] = 0;
    bool running = true;
    while (running && --n >= 0) {
        running = false;
        for (auto& arc : arcs) {
            if (dist[arc.to] < dist[arc.from] + arc.value) {
                dist[arc.to] = dist[arc.from] + arc.value;
                running = true;
                if (n <= 0) 
                    return vector<T>();
            }
        }
    }
    return dist;
}

vector<DGraphE::W_T> shortestPathFasterAlgorithm(const DGraphE& graph, int start = 0, bool* detectNegativeCycle = nullptr){
    using T = DGraphE::W_T;
    const int n = graph.n;
    vector<bool> incl(n);
    vector<T> dist(n, numeric_limits<T>::max()/2);
    vector<int> counter;
    if (detectNegativeCycle)
        *detectNegativeCycle = false,
        counter.resize(n);
    
    queue<int> que;
    que.push(start);
    incl[start] = true;
    dist[start] = 0;
    while (!que.empty()) {
        int v = que.front(); que.pop();
        incl[v] = false;
        for (auto ai : graph.vertex_to[v]) {
            auto a = graph.arcs[ai];
            
            if (dist[a.to] <= dist[v] + a.value) continue;
            dist[a.to] = dist[v] + a.value;
            
            if (incl[a.to]) continue;
            incl[a.to] = true;
            que.push(a.to);
            
            if (detectNegativeCycle && ++counter[a.to] >= n) {
                *detectNegativeCycle = true;
                return move(dist);
            }
        }
    }
    return move(dist);
}


// 

int N, M;
ll P;

vector<array<int, 3>> edges;

//

int main() {
    scanner >> N >> M >> P;
    DGraph dg(N);
    DGraph dgr(N);
    
    repeat(i, M) {
        int a, b, c;
        scanner >> a >> b >> c;
        --a; --b;
        edges.push_back({a, b, c-P});
        dg.connect(a, b);
        dgr.connect(b, a);
    }
    auto va = dijkstraD(dgr, N-1);
    auto vb = dijkstraD(dg, 0);
    
    DGraphE g(N);
    
    for (auto e : edges) {
        if (va[e[0]] < N && va[e[1]] < N && vb[e[0]] < N && vb[e[1]] < N)
            g.connect(e[0], e[1], -e[2]);
    }
    
    bool detect;
    auto d = shortestPathFasterAlgorithm(g, 0, &detect);
    
    if (detect) bye("-1");
    
    cout << max(0ll, -d[N-1]) << endl;
    return 0;
}


Measured memory_bytes: 1280