#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

using namespace std;

const int inf=0x7fffffff,N=1005;

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

int S=0,T=1001,P,Q,n,m,cnt=0,ans,s[N],t[N],d[N],q[N],from[N],g[N],p[N],flow,tot,k;

bool in[1005];

struct edge{int from,to,nxt,c,v;}e[100001];

void add(int u,int v,int w,int c){

    e[++cnt].from=u;e[cnt].to=v;

    e[cnt].nxt=g[u];g[u]=cnt;

    e[cnt].c=c;e[cnt].v=w;

}void insert(int u,int v,int w,int c){add(u,v,w,c);add(v,u,0,-c);}

bool spfa(){

    for(int i=S;i<=T;i++)d[i]=inf;

    int t=0,w=1;d[S]=0;in[S]=1;q[0]=S;

    while(t!=w){

        int now=q[t];t++;if(t==T)t=0;

        for(int i=g[now];i;i=e[i].nxt)

            if(e[i].v&&d[e[i].to]>d[now]+e[i].c){

                d[e[i].to]=d[now]+e[i].c;from[e[i].to]=i;

                if(!in[e[i].to]){in[e[i].to]=1;q[w++]=e[i].to;if(w==T)w=0;}

            }in[now]=0;

    }return(d[T]!=inf);

}

void mcf(){

    int x=inf;

    for(int i=from[T];i;i=from[e[i].from])x=min(x,e[i].v);flow+=x;

    for(int i=from[T];i;i=from[e[i].from]){e[i].v-=x;e[i^1].v+=x;ans+=e[i].c*x;}

}

int main(){

    while(~scanf("%d%d",&n,&m)){

        memset(g,0,sizeof(g));

        memset(e,0,sizeof(e));

        ans=flow=0; cnt=1;

        for(int i=1;i<=m;i++){

            int u,v,cost;

            scanf("%d%d%d",&u,&v,&cost);

            insert(u+n,v,1,cost);

        }

        for(int i=2;i<n;i++)insert(i,i+n,1,0);

        S=1,T=n+n;

        insert(1,1+n,inf,0);

        insert(n,T,inf,0);

        while(spfa())mcf();

        printf("%d %d\n",flow,ans);

    }return 0;

}