#include<bits/stdc++.h> 
#define ll long long 
#define LL __int128_t 
#define PB push_back
#define MK make_pair
#define Pair pair<int, int>
#define fi first
#define se second
#define FOR(i, x, y) for (decay<decltype(y)>::type i = (x), _##i = (y); i <= _##i; ++i)
#define FORD(i, x, y) for (decay<decltype(x)>::type i = (x), _##i = (y); i >= _##i; --i)
#define debug(x) cout<< "\033 -> "<<#x<<": "<<x<<endl
using namespace std;
const int N(2005);
#define X first
#define val second
vector<Pair> e[N];
int dis[N], die[N];
int main() 
{ 
	//freopen("1.in","r",stdin); 
	ios::sync_with_stdio(false); 
	cin.tie(NULL);
	int n, m, w;
	cin >> n >> m >> w;
	FOR(i, 1, m)
	{
		int x, y, t; cin >> x >> y >> t;
		e[x].PB(MK(y, t));
	}
	for(int i = 1; i <= n+1; ++i) dis[i] = -20000000;
	dis[1] = 0;
	int ans = dis[n+1];
	for(int i = 1; i <= 1000000; ++i)
		FOR(j, 1, n) if(dis[j] != dis[n+1])
		{
			int update = 1;
			for(auto to : e[j])
			{
				if(dis[to.X] < dis[j] + to.val)
					if(dis[j] + to.val <= w)
					{
						dis[to.X] = dis[j] + to.val, update = 0;
						if(to.X == n) ans = max(dis[n], ans);
					}
				if(to.val < 0 && die[to.X]) dis[to.X] = dis[j] + to.val;
			}
			die[j] = update;
		}
	cout<<ans<<endl;
	return 0; 
}