#include<bits/stdc++.h>
inline void rd(){}
template<typename T,typename ...U>
inline void rd(T &x,U &...args){
    int ch=getchar();
    T f=1;x=0;
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    x*=f;rd(args...);
}
#define int long long
const int N=3e4+5;
int n,m,s,t;
int fst[N],nxt[N],v[N],w[N],f[N],idx;
inline void Add(int a,int b,int c,int d){
    v[idx]=b;w[idx]=c,f[idx]=d;
    nxt[idx]=fst[a];fst[a]=idx++;
}
const int INF=1e9;
int dis[N],vis[N],now[N];
inline bool SPFA(){
    for(int i=1;i<=n;i++)dis[i]=INF,vis[i]=0,now[i]=fst[i];
    std::queue<int> q;
    q.push(s);dis[s]=0,vis[s]=1;
    while(!q.empty()){
        int x=q.front();q.pop();
        vis[x]=0;
        for(int i=fst[x];~i;i=nxt[i]){
            int y=v[i];
            if(dis[y]>dis[x]+f[i]&&w[i]){
                dis[y]=dis[x]+f[i];
                if(!vis[y])q.push(y);
            }
        }
    }
    return dis[t]<INF;
}
int ANS=0;
int Dinic(int x=s,int sum=INF){
    if(x==t)return sum;
    int ans=0;vis[x]=1;
    for(int i=now[x];~i&&sum;i=nxt[i]){
        now[x]=i;int y=v[i];
        if(!w[i]||vis[y]||dis[y]!=dis[x]+f[i])continue;
        int k=Dinic(y,std::min(sum,w[i]));
        if(!k)dis[y]=INF;
        w[i]-=k,w[i^1]+=k;
        ans+=k,sum-=k;ANS+=k*f[i];
    }
    return ans;
}
signed main(){
    memset(fst,-1,sizeof fst);
    rd(n,m);s=1,t=n;
    for(int i=1;i<=m;i++){
        int x,y,z,w;rd(x,y,z,w);
        Add(x,y,z,w);Add(y,x,0,-w);
    }
    int ans=0;
    while(SPFA())ans+=Dinic();
    printf("%lld %lld\n",ans,ANS);
    return 0;
}