#include<bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x)
{
	x=0;short f=1;char c=getchar();
	for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
	for(;c>='0'&&c<='9';c=getchar()) x=(x<<1)+(x<<3)+(c^48);
	x*=f;return;
}
#define pa(x) (x%2==0?x-1:x+1)
const int N=405,M=15005,inf=INT_MAX;
int n,m,S,T;
struct edge{
	int v,nxt,w,c;
}e[M*2];
int head[N],cnt=1;
void add(int u,int v,int c,int w)
{
	e[cnt].v=v,e[cnt].c=c,e[cnt].w=w,e[cnt].nxt=head[u],head[u]=cnt++;
	e[cnt].v=u,e[cnt].c=0,e[cnt].w=-w,e[cnt].nxt=head[v],head[v]=cnt++;
}
int pre[N];
int dis[N],incf[N];
bool vis[N];
queue<int>q;
bool spfa()
{
	memset(dis,0x3f,sizeof dis);
	memset(incf,0,sizeof incf);
	memset(vis,0,sizeof vis);
	dis[S]=0,incf[S]=inf,q.push(S);
	while(!q.empty())
	{
		int u=q.front();q.pop();
		vis[u]=0;
		for(int i=head[u];i;i=e[i].nxt)
		{
			int v=e[i].v,c=e[i].c,w=e[i].w;
			if(dis[v]>dis[u]+w&&c)
			{
				dis[v]=dis[u]+w;
				pre[v]=i;
				incf[v]=min(incf[u],c);
				if(!vis[v]) q.push(v),vis[v]=1;
			}
		}
	} 
	return incf[T]>0;
}
pair<int,int> EK()
{
	int cost=0,flow=0;
	while(spfa())
	{
		int t=incf[T],d=dis[T];
		cost+=d*t,flow+=t;
		for(int i=T;i!=S;i=e[pa(pre[i])].v)
			e[pre[i]].c-=t,e[pa(pre[i])].c+=t;
	}
	return {flow,cost};
}
int main()
{
	read(n),read(m);
	for(int i=1;i<=m;++i)
	{
		int u,v,c,w;read(u),read(v),read(c),read(w);
		add(u,v,c,w);
	}
	S=1,T=n;
	auto p=EK();
	printf("%d %d\n",p.first,p.second);
}