#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

class Edge
{
public:
    int to, cost;
    Edge(int to, int cost){
        this->to = to;
        this->cost = cost;
    }
};

int main()
{
    int n, m;
    cin >> n >> m;
    vector<vector<Edge> > edges(n);
    vector<vector<Edge> > revEdges(n);
    vector<int> out(n, 0);
    vector<int> in(n, 0);
    for(int i=0; i<m; ++i){
        int a, b, c;
        cin >> a >> b >> c;
        edges[a].push_back(Edge(b, c));
        revEdges[b].push_back(Edge(a, c));
        ++ out[a];
        ++ in[b];
    }

    queue<int> q;
    vector<int> fast(n, 0);
    for(int i=0; i<n; ++i){
        if(in[i] == 0)
            q.push(i);
    }
    while(!q.empty()){
        int curr = q.front();
        q.pop();
        for(const Edge& e : edges[curr]){
            fast[e.to] = max(fast[e.to], fast[curr] + e.cost);
            -- in[e.to];
            if(in[e.to] == 0)
                q.push(e.to);
        }
    }

    vector<int> slow(n, INT_MAX);
    for(int i=0; i<n; ++i){
        if(out[i] == 0){
            slow[i] = fast[i];
            q.push(i);
        }
    }
    while(!q.empty()){
        int curr = q.front();
        q.pop();
        for(const Edge& e : revEdges[curr]){
            slow[e.to] = min(slow[e.to], slow[curr] - e.cost);
            -- out[e.to];
            if(out[e.to] == 0)
                q.push(e.to);
        }
    }

    int ans = 0;
    for(int i=0; i<n; ++i){
        if(fast[i] < slow[i])
            ++ ans;
    }
    cout << *max_element(fast.begin(), fast.end()) << ' '
         << ans << '/' << n << endl;

    return 0;
}