using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Diagnostics;

class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		
		int[] InDeg = new int[N];
		for(int i=0;i<N;i++){
			foreach(var e in E[i]) InDeg[B[e]]++;
		}
		
		Debug.Assert( InDeg[0] == 0 );
		Debug.Assert( InDeg.Skip(1).Select(x => x !=0).Aggregate(true, (b,y) => b&y ) );
		
		int[] ENT = new int[N];	// Earliest Node Time
		for(int i=0;i<N;i++) ENT[i] = -1;
		ENT[0] = 0;
		
		Queue<int> Q = new Queue<int>(N);
		Q.Enqueue(0);
		while(Q.Count>0){
			var now = Q.Dequeue();
			foreach(var e in E[now]){
				InDeg[B[e]]--;
				if(InDeg[B[e]] == 0){
					Q.Enqueue(B[e]);
				}
				ENT[B[e]] = Math.Max(ENT[B[e]], ENT[now] + C[e]);
			}
		}
		
		Debug.Assert( InDeg.Select(x => x == 0).Aggregate(true, (b,y) => b&y ) );
		
		
		
		int[] OutDeg = new int[N];
		
		int[] LNT = new int[N]; // Latest Node Time
		for(int i=0;i<N;i++) LNT[i] = int.MaxValue;
		LNT[N-1] = ENT[N-1];
		
		Q = new Queue<int>(N);
		Q.Enqueue(N-1);
		while(Q.Count>0){
			var now = Q.Dequeue();
			foreach(var xe in XE[now]){
				OutDeg[A[xe]]++;
				if(OutDeg[A[xe]] == E[A[xe]].Count){
					Q.Enqueue(A[xe]);
				}
				LNT[A[xe]] = Math.Min(LNT[A[xe]], LNT[now] - C[xe]);
			}
		}
		
		Debug.Assert( OutDeg[N-1] == 0 );
		Debug.Assert( OutDeg.Zip(E,(n,p) => n == p.Count).Aggregate(true, (b,y) => b&y ) );
		Debug.Assert( ENT.Zip(LNT,(e,l) => e > l).Count( b => b ) == 0);
		
		//Console.WriteLine(String.Join(" ",ENT));
		//Console.WriteLine(String.Join(" ",LNT));
		
		int marginPersonCount = ENT.Zip(LNT,(e,l) => l > e).Count( b => b );
		Console.WriteLine("{0} {1}/{2}",ENT[N-1],marginPersonCount,N);
		
	}
	
	int N,M;
	List<int>[] E;
	List<int>[] XE;
	int[] A,B,C;
	
	
	public Sol(){
		// read input
		int[] d;
		d = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
		N = d[0]; M = d[1];
		
		E = new List<int>[N];
		for(int i=0;i<N;i++) E[i] = new List<int>();
		XE = new List<int>[N];
		for(int i=0;i<N;i++) XE[i] = new List<int>();
		
		A = new int[M];
		B = new int[M];
		C = new int[M];
		
		for(int i=0;i<M;i++){
			d = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
			A[i] = d[0];
			B[i] = d[1];
			C[i] = d[2];
			E[d[0]].Add(i);
			XE[d[1]].Add(i);
		}
	}
	
	
}