#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int maxn=405;
const int maxm=4e4+10;
const ll maxxn=0x3f3f3f3f3f3f3f3f;

inline int read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}

int n,m,S,T,tot;
int id[205][2];
struct Graph{
    struct edge{
        int to,nxt;
        ll lim,c;
    }e[maxm<<1];
    int head[maxn],cnt=1;
    inline void add_edge(int u,int v,ll w,ll c){
        e[++cnt].to=v,e[cnt].nxt=head[u],e[cnt].lim=w,e[cnt].c=c,head[u]=cnt;
        e[++cnt].to=u,e[cnt].nxt=head[v],e[cnt].lim=0,e[cnt].c=-c,head[v]=cnt;
    }
    int pre[maxn];
    ll dis[maxn];
    bool vis[maxn];
    inline void SPFA(){
        queue<int> q;
        memset(dis,0x3f,sizeof(dis));
        memset(vis,0,sizeof(vis));
        dis[S]=0,vis[S]=1;
        q.push(S);
        while(!q.empty()){
            int u=q.front();
            vis[u]=0;
            q.pop();
            for(int i=head[u];i;i=e[i].nxt){
                int v=e[i].to;
                ll c=e[i].c;
                if(dis[u]+c<dis[v]&&e[i].lim){
                    dis[v]=dis[u]+c;
                    pre[v]=i;
                    if(vis[v]) continue;
                    vis[v]=1;
                    q.push(v);
                }
            }
        }
    }
    inline pair<ll,ll> max_flow(){
        ll flow=0,min_cost=0;
        while(1){
            SPFA();
            if(dis[T]==maxxn) return make_pair(flow,min_cost);
            ll mn=maxxn;
            for(int u=T;u!=S;u=e[pre[u]^1].to){
                mn=min(mn,e[pre[u]].lim);
            }
            flow+=mn;
            for(int u=T;u!=S;u=e[pre[u]^1].to){
                min_cost+=e[pre[u]].c*mn;
                e[pre[u]].lim-=mn,e[pre[u]^1].lim+=mn;
            }
        }
    }
}G;

int main(){
    n=read(),m=read();
    S=1,T=2,tot=2;
    for(int i=1;i<=n;++i){
        if(i==1) id[i][0]=id[i][1]=S;
        else if(i==n) id[i][0]=id[i][1]=T;
        else{
            id[i][0]=++tot,id[i][1]=++tot;
            G.add_edge(id[i][0],id[i][1],1,0);
        } 
    }
    for(int i=1;i<=m;++i){
        int u=read(),v=read(),c=read();
        if(u==1&&v==n) G.add_edge(S,T,1,c);
        else G.add_edge(id[u][1],id[v][0],1e9,c);
    }
    pair<ll,ll> ans=G.max_flow();
    printf("%lld %lld\n",ans.first,ans.second);
    return 0;
}