import sys
input = sys.stdin.readline

from collections import *
def topsort(G):
    Q = deque()
    N = len(G)
    count = [0] * N

    for u in range(N):
        for v in G[u]:
            count[v] += 1

    for u in range(N):
        if count[u] == 0:
            Q.append(u)
    anslst = deque()
    while Q:
        u = Q.pop()
        anslst.append(u)
        for v in G[u]:
            count[v] -= 1
            if count[v] == 0:
                Q.append(v)
    return list(anslst)


N, M = map(int, input().split())
G = [[] for i in range(N)]
GG = [[] for i in range(N)]
Gr = [[] for i in range(N)]
for i in range(M):
    A, B, C = map(int, input().split())
    G[A].append((B, C))
    Gr[B].append((A, C))
    GG[A].append(B)

A = topsort(GG)
inf = 10 ** 18
dp, dpr = [-inf] * N, [inf] * N
dp[0] = 0
for a in A:
    for u, c in G[a]:
        dp[u] = max(dp[u], dp[a] + c) 

A.reverse()
dpr[-1] = dp[-1]
for a in A:
    for u, c in Gr[a]:
        dpr[u] = min(dpr[u], dpr[a] - c) 

cnt = 0
for i in range(N):
    cnt += int(dp[i]!=dpr[i])

ans = str(cnt) + "/" + str(N)
print(dp[-1], ans)