#include <bits/stdc++.h>
#define each(i,a,b) for(int i=(a);i<=(b);++i)
#define eachr(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int N=455,M=1e6+15,inf=0x3f3f3f3f;

inline int rd(){
    int w=1,r=0;char c=getchar();
    while(!isdigit(c)) (c=='-')and(w=-1),c=getchar();
    while(isdigit(c)) r=r*10+(c^48),c=getchar();
    return r*w;
}

int n,m,S,T;
int head[N],cur[N],vis[N],tt=1,cost;
struct edge{int to,nxt;int w,c;}ed[M];
int dis[N];

inline void add(int u,int v,int w,int c){
    ed[++tt]={v,head[u],w,c},head[u]=tt;
    ed[++tt]={u,head[v],0,-c},head[v]=tt;
}

int spfa(){
    queue<int> q;q.push(S);
    memset(dis,0x3f,sizeof dis),memcpy(cur,head,sizeof cur);
    dis[S]=0,vis[S]=1;
    while(!q.empty()){
        int u=q.front();q.pop(),vis[u]=0;
        for(int i=head[u],v;i;i=ed[i].nxt){
            v=ed[i].to;
            if(dis[v]<=dis[u]+ed[i].c || !ed[i].w) continue;
            if(!vis[v]) q.push(v),vis[v]=1;
            dis[v]=dis[u]+ed[i].c;
        }
    }
    return dis[T]<inf;
}

int dfs(int u,int flow){
    if(u==T) return flow;
    vis[u]=1;
    int tmp,res=0;
    for(int i=cur[u],v;i;i=ed[i].nxt){
        v=ed[i].to;
        if(dis[v]!=dis[u]+ed[i].c || !ed[i].w || vis[v]) continue;
        tmp=dfs(v,min(ed[i].w,flow-res));
        res+=tmp,flow-=tmp,ed[i].w-=tmp,ed[i^1].w+=tmp,cost+=tmp*ed[i].c;
        if(!flow) break;
    }
    vis[u]=0;
    return res;
}

int dinic(){
    int res=0,t;
    while(spfa())
		while(t=dfs(S,INT_MAX)) res+=t;
    return res;
}

int main(){
    n=rd(),m=rd(),S=1,T=n;
    each(i,1,m){
        int u=rd(),v=rd(),w=rd(),c=rd();
        add(u,v,w,c);
    }
	int ans=dinic();
    printf("%d %d\n",ans,cost);
    return 0;
}