#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }

using Graph = vector<vector<int>>;
vector<int> tsort(Graph &g) {
    int n = g.size(), k = 0;
    vector<int> ord(n), in(n);
    for (int u = 0; u < n; u++) for (int v: g[u]) in[v]++;
    queue<int> que;
    for (int u = 0; u < n; u++) if (in[u] == 0) que.push(u);
    while (!que.empty()) {
        int u = que.front(); que.pop();
        ord[k++] = u;
        for (int v: g[u]) if (--in[v] == 0) que.push(v);
    }
    return *max_element(in.begin(), in.end()) == 0 ? ord : vector<int>();
}

using edge = pair<int, long long>;
using graph = vector<vector<edge>>;
int main() {
    int n, m; cin >> n >> m;
    Graph g(n);
    graph gg(n), rg(n);
    while (m--) {
        int a, b, c; cin >> a >> b >> c;
        g[a].emplace_back(b);
        gg[a].emplace_back(b, c);
        rg[b].emplace_back(a, c);
    }
    auto ord = tsort(g);
    vector<long long> dp(n);
    for (int u: ord) for (auto &p: gg[u]) {
        int v = p.first; long long c = p.second;
        chmax(dp[v], dp[u] + c);
    }
    long long typical = dp.back();
    reverse(ord.begin(), ord.end());
    vector<int> on_typ(n); on_typ.back() = true;
    for (int v: ord) if (on_typ[v]) for (auto &p: rg[v]) {
        int u = p.first; long long c = p.second;
        if (dp[u] + c == dp[v]) on_typ[u] |= on_typ[v];
    }
    int cnt = count(on_typ.begin(), on_typ.end(), false);
    cout << typical << " " << cnt << "/" << n << endl;
    return 0;
}