#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N, M = map(int, readline().split())
m = map(int, read().split())
ABC = zip(m, m, m)

graph = [[] for _ in range(N)]
graph_rev = [[] for _ in range(N)]
in_deg = [0] * N
for a, b, c in ABC:
    graph[a].append((b, c))
    graph_rev[b].append((a, c))
    in_deg[b] += 1

deg_0 = [i for i, x in enumerate(in_deg) if not x]
order = []
while deg_0:
    v = deg_0.pop()
    order.append(v)
    for w, _ in graph[v]:
        in_deg[w] -= 1
        if in_deg[w] == 0:
            deg_0.append(w)

dp1 = [0] * N
for v in order:
    dv = dp1[v]
    for w, c in graph[v]:
        dw = dv + c
        if dp1[w] < dw:
            dp1[w] = dw
dp2 = [0] * N
for v in order[::-1]:
    dv = dp2[v]
    for w, c in graph_rev[v]:
        dw = dv + c
        if dp2[w] < dw:
            dp2[w] = dw

T = dp1[-1]
dp2 = [T - x for x in dp2]
P = sum(x < y for x, y in zip(dp1, dp2))
print(f'{T} {P}/{N}')