#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int N=100010;
const int M=500010;
inline int read(){int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;
}
int n,m,tot,idx,top,cnt,ans;
int head[N],dis[N],u[M],v[M],w[M],f[N],g[N];
int dfn[N],low[N],sta[N],B[N],du[N],s[N];
bool instack[N];
queue<int>q;
struct node{int next,to,dist;
}e[M];
inline void ins(int from,int to,int dist){e[++tot].next=head[from];e[tot].to=to; e[tot].dist=dist;head[from]=tot;
}
void tarjan(int x){dfn[x]=low[x]=++idx;sta[++top]=x; instack[x]=true;for(int i=head[x];i;i=e[i].next)if(!dfn[e[i].to]){tarjan(e[i].to);low[x]=min(low[x],low[e[i].to]);}else if(instack[e[i].to])low[x]=min(low[x],dfn[e[i].to]);if(dfn[x]==low[x]){++cnt; int y;do{y=sta[top--];instack[y]=false;B[y]=cnt; ++s[cnt];}while(x!=y);}
}
void dfs(int x){for(int i=head[x];i;i=e[i].next)if(++du[e[i].to]==1) dfs(e[i].to);
}
int main(){freopen("teach.in","r",stdin);freopen("teach.out","w",stdout);n=read();m=read();for(int i=1;i<=m;++i){u[i]=read();v[i]=read();w[i]=read();ins(u[i],v[i],w[i]);}for(int i=1;i<=n;++i)if(!dfn[i]) tarjan(i);tot=0;memset(head,0,sizeof(head));for(int i=1;i<=m;++i)if(B[u[i]]!=B[v[i]])ins(B[u[i]],B[v[i]],w[i]);memset(g,0x3f,sizeof(0x3f));f[B[1]]=g[B[1]]=s[B[1]]; --g[B[1]];dfs(B[1]); q.push(B[1]);while(!q.empty()){int x=q.front();q.pop();for(int i=head[x];i;i=e[i].next){int to=e[i].to; --du[to];if(!du[to]) q.push(to);if(f[x]+s[to]>f[to]){f[to]=f[x]+s[to]; g[to]=g[x]+e[i].dist+s[to]-1;}else if(f[x]+s[to]==f[to])g[to]=min(g[to],g[x]+e[i].dist+s[to]-1);}}for(int i=1;i<=cnt;++i)if(f[i]>f[ans]) ans=i;else if(f[i]==f[ans]&&g[i]<g[ans]) ans=i;printf("%d %d\n",f[ans],g[ans]);return 0;
}