#define _CRT_SECURE_NO_WARNINGS
#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<tuple>
#include<unordered_set>
#include<random>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())



vector<int> topologicalSort(int v, const vector<int> edge[]) {
	vector<int> zeros;
	vector<int> in(v), res;
	for (int i = 0; i<v; i++) {
		for (int j = 0; j<(int)edge[i].size(); j++)in[edge[i][j]]++;
	}
	for (int i = 0; i<v; i++)if (in[i] == 0)zeros.push_back(i);
	while (!zeros.empty()) {
		int u = zeros.back();
		zeros.pop_back();
		res.push_back(u);
		for (int i = 0; i<(int)edge[u].size(); i++) {
			if (--in[edge[u][i]] == 0)zeros.push_back(edge[u][i]);
		}
	}
	return res;
}





int n, m;
vector<int> e[100000];
vector<pair<int, int>> edge[100000];
 
int dp[100000];
bool critical[100000];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n >> m;
	rep(i,m) {
		int a, b, c;
		cin >> a >> b >> c;
		e[a].push_back(b);
		edge[a].emplace_back(b, c);
	}
	auto ord = topologicalSort(n, e);
	rep(i,n) {
		for (auto p : edge[ord[i]]) {
			dp[p.first] = max(dp[p.first], dp[ord[i]] + p.second);
		}
	}
	critical[n - 1] = true;
	int cnt = 0;
	for (int i = n - 2; i >= 0;i--){
		bool f = true;
		for (auto p : edge[ord[i]]) {
			if (critical[p.first] && dp[p.first] == dp[ord[i]] + p.second)f = false;
		}
		if (f)cnt++;
		else critical[ord[i]] = true;
	}

	cout << dp[n - 1] << ' ' << cnt << '/' << n << endl;

	
	return 0;
}