#include<cstdio>
#include<iostream>
#include<queue>
#include<utility>
using namespace std;
const int o=1e5,inf=(1ll<<31)-1;
int n,m,S,T,h[o],cnt=1,flow[o],lst[o],phi[o],dis[o],ans1,ans2;bool vis[o];priority_queue<pair<int,int> > q;queue<int> Q;
struct Edge{int v,p,c,f;}e[o];
inline void ad(int U,int V,int C,int F){e[++cnt].v=V;e[cnt].p=h[U];e[h[U]=cnt].c=C;e[cnt].f=F;}
inline void add(int ST,int ED,int CA,int FY){ad(ST,ED,CA,FY);ad(ED,ST,0,-FY);}
inline void spfa(){
	for(int i=1;i<=n;++i) dis[i]=inf;
	for(Q.push(S),dis[S]=0,vis[S]=1;!Q.empty();vis[Q.front()]=0,Q.pop())
		for(int i=h[Q.front()];i;i=e[i].p) if(e[i].c&&dis[Q.front()]+e[i].f<dis[e[i].v])
			{dis[e[i].v]=dis[Q.front()]+e[i].f;if(!vis[e[i].v]) Q.push(e[i].v),vis[e[i].v]=1;}
}
inline bool dijkstra(){
	for(int i=1;i<=n;++i) phi[i]+=dis[i],dis[i]=inf,lst[i]=vis[i]=0;
	for(q.push(make_pair(dis[S]=0,S)),flow[S]=inf;!q.empty();){
		int t=q.top().second;
		q.pop();
		if(vis[t]) continue;
		vis[t]=1;
		for(int i=h[t];i;i=e[i].p) if(e[i].c&&dis[t]+e[i].f+phi[t]-phi[e[i].v]<dis[e[i].v])
			q.push(make_pair(-(dis[e[i].v]=dis[t]+e[i].f+phi[t]-phi[e[i].v]),e[i].v)),
			flow[e[i].v]=min(flow[t],e[lst[e[i].v]=i].c);
	}
	return lst[T];
}
int main(){
	scanf("%d%d",&n,&m);S=1;T=n;
	for(int u,v,c,f;m--;add(u,v,c,f)) scanf("%d%d%d%d",&u,&v,&c,&f);
	for(spfa();dijkstra();ans1+=flow[T],ans2+=flow[T]*(dis[T]+phi[T]))
		for(int i=T;i^S;i=e[lst[i]^1].v) e[lst[i]].c-=flow[T],e[lst[i]^1].c+=flow[T];
	printf("%d %d",ans1,ans2);
	return 0;
}