#include<bits/stdc++.h>
using namespace std;
const int NR=410;
const int MR=3e4+10;
int n,m,s,t;
struct edge{
	int to,next,flow,v;
}g[MR];
int tot=1,fte[NR];
void add(int x,int y,int z,int w){
	g[++tot]=(edge){y,fte[x],z,w};fte[x]=tot;
	g[++tot]=(edge){x,fte[y],0,-w};fte[y]=tot;
}

int dist[NR],vis[NR];
bool SPFA(){
	memset(dist,999999,sizeof(dist));
	queue<int>q;
	dist[s]=0;vis[s]=0;q.push(s);
	while(!q.empty()){
		int x=q.front();q.pop();vis[x]=0;
		for(int i=fte[x];i;i=g[i].next)
			if(dist[g[i].to]>dist[x]+g[i].v&&g[i].flow){
				dist[g[i].to]=dist[x]+g[i].v;
				if(!vis[g[i].to])q.push(g[i].to),vis[g[i].to]=1;
			}
	}
	return dist[t]<1e9;
}
int ans1,ans2;
int dfs(int id,int Lim){
	if(id==t)return Lim;
	int flow=0,f;vis[id]=1;
	for(int i=fte[id];i;i=g[i].next){
		int x=g[i].to;
		if(g[i].flow&&dist[x]==g[i].v+dist[id]&&!vis[x]){
			f=dfs(x,min(Lim-flow,g[i].flow));
			ans2+=f*g[i].v;g[i].flow-=f;g[i^1].flow+=f;
			flow+=f;
		}
		if(flow==Lim)break;
	}
	vis[id]=0;
	return flow;
}
void Dinic(){
	int Flow=0;
	while(SPFA())
		while(Flow=dfs(s,1e9))ans1+=Flow;
}

int main(){
	cin>>n>>m;s=1;t=n;
	for(int i=1,x,y,z,w;i<=m;i++)
		cin>>x>>y>>z>>w,add(x,y,z,w);
	Dinic();
	cout<<ans1<<" "<<ans2<<endl;
	return 0;
}