#include<cstdio>

 #include<cstdlib>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 #include<iostream>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<string>

 #define inf 1000000000

 #define maxn 550000

 #define maxm 500+100

 #define eps 1e-10

 #define ll long long

 #define pa pair<int,int>

 #define for0(i,n) for(int i=0;i<=(n);i++)

 #define for1(i,n) for(int i=1;i<=(n);i++)

 #define for2(i,x,y) for(int i=(x);i<=(y);i++)

 #define for3(i,x,y) for(int i=(x);i>=(y);i--)

 #define mod 1000000007

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=*x+ch-'';ch=getchar();}

     return x*f;

 }

 int n,m,cnt,ti,tot,head[maxn],inp[maxn],dfn[maxn],low[maxn],sta[maxn],top;

 int scc[maxn],s[maxn],f[maxn],a[maxn],b[maxn],c[maxn];

 ll g[maxn];

 struct edge{int go,next,w;}e[maxn];

 queue<int> q;

 inline void insert(int x,int y,int z)

 {

     e[++tot].go=y;e[tot].next=head[x];e[tot].w=z;head[x]=tot;

 }

 inline void tarjan(int x)

 {

     dfn[x]=low[x]=++ti;sta[++top]=x;

     for(int i=head[x],y;i;i=e[i].next)

      if(!dfn[y=e[i].go])

       {

           tarjan(y);low[x]=min(low[x],low[y]);

       }

      else if(!scc[y])low[x]=min(low[x],dfn[y]);

     if(low[x]==dfn[x])

      {

          cnt++;int now=;

          while(now!=x)

          {

              now=sta[top--];scc[now]=cnt;s[cnt]++;

          }

      }

 }

 inline void dfs(int x)

 {

     for(int i=head[x];i;i=e[i].next)

     {

         int y=e[i].go;

         inp[y]++;

         if(inp[y]==)dfs(y);

     }

 }

 int main()

 {

     freopen("input.txt","r",stdin);

     freopen("output.txt","w",stdout);

     n=read();m=read();

     for1(i,m){a[i]=read();b[i]=read();c[i]=read();insert(a[i],b[i],c[i]);}

     for1(i,n)if(!dfn[i])tarjan(i);

     memset(head,,sizeof(head));tot=;

     for1(i,m)if(scc[a[i]]!=scc[b[i]])insert(scc[a[i]],scc[b[i]],c[i]);

     for1(i,cnt)f[i]=,g[i]=inf;

     f[scc[]]=g[scc[]]=s[scc[]];g[scc[]]--;

     dfs(scc[]);

     q.push(scc[]);

     //for1(i,cnt)if(!inp[i])q.push(i),f[i]=s[i],g[i]=s[i]-1;

     while(!q.empty())

     {

         int x=q.front();q.pop();

         for(int i=head[x];i;i=e[i].next)

         {

             int y=e[i].go;

             inp[y]--;

             if(!inp[y])q.push(y);

             if(f[x]+s[y]>f[y])f[y]=f[x]+s[y],g[y]=g[x]+e[i].w+s[y]-;

             else if(f[x]+s[y]==f[y])g[y]=min(g[y],g[x]+e[i].w+s[y]-);

         }

     }

     int ans=;

     for1(i,cnt)

     if(f[i]>f[ans])ans=i;

     else if(f[i]==f[ans]&&g[i]<g[ans])ans=i;

     printf("%d %lld\n",f[ans],g[ans]);

     return ;

 }