import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

n,m,a=LI()
to=[[] for _ in range(n)]
ll=[]
for _ in range(m):
    l,r,p=LI()
    l-=1
    ll.append(l)
    to[l].append((r,p-a))

dp=[-a]*(n+1)
dp[0]=0
for l in ll:
    pre=dp[l]
    if pre==-inf:continue
    for r,p in to[l]:
        dp[r]=max(dp[r],dp[l]+p)
dp[-1]+=a

print(max(dp))