#include<bits/stdc++.h>
#define int long long
#define inf 1121131433448687LL
using namespace std;
inline int read()
{
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
struct bbian
{
	int u,v,w,f,nex;
}a[200005];
int head[100005],tmp=1;
void addb(int x,int y,int z,int f)
{
	a[++tmp].u=x;
	a[tmp].v=y;
	a[tmp].w=z;
	a[tmp].f=f;
	a[tmp].nex=head[x];
	head[x]=tmp;
}
int dis[200005],qz[200005];
int n,m,s,t;
queue<int>que;
bool inq[200005];
int maxflow,mincost,delta;
void reduce()
{
	for(int i=2;i<=tmp;i++)
	{
		a[i].f+=dis[a[i].v]-dis[a[i].u];
		//printf("???%lld %lld %lld %lld\n",a[i].u,a[i].v,a[i].w,a[i].f);
	}
	delta+=dis[s];
}
bool spfa()
{
	for(int i=1;i<=n;i++)dis[i]=inf,inq[i]=false;
	dis[t]=0;
	que.push(t);
	while(!que.empty())
	{
		int x=que.front();
		inq[x]=false;
		que.pop();
		for(int i=head[x];i;i=a[i].nex)
		{
			if(a[i^1].w==0)continue;
			if(dis[a[i].v]>dis[x]+a[i^1].f)
			{
				dis[a[i].v]=dis[x]+a[i^1].f;
				if(!inq[a[i].v])
				{
					inq[a[i].v]=true;
					que.push(a[i].v);
				}
			}
		}
	}
	//for(int i=1;i<=n;i++)printf("%lld ",dis[i]);
	//printf("\n");
	return dis[s]!=inf;
}
priority_queue<pair<int,int> >pq;
bool dijkstra()
{
	for(int i=1;i<=n;i++)dis[i]=inf;
	dis[t]=0;
	pq.push(make_pair(0,t));
	while(!pq.empty())
	{
		int x=pq.top().second;
		if(pq.top().first!=-dis[x])
		{
			pq.pop();
			continue;
		}
		pq.pop();
		for(int i=head[x];i;i=a[i].nex)
		{
			if(a[i^1].w==0)continue;
			if(dis[a[i].v]>dis[x]+a[i^1].f)
			{
				dis[a[i].v]=dis[x]+a[i^1].f;
				pq.push(make_pair(-dis[a[i].v],a[i].v));
			}
		}
	}
	return dis[s]!=inf;
}
bool vis[200005];
int dfs(int x,int nf)
{
	if(x==t||nf==0)return nf;
	//printf("%lld %lld\n",x,nf);
	vis[x]=true;
	int res=nf;
	for(int i=head[x];i;i=a[i].nex)
	{
		if(vis[a[i].v]==false&&a[i].w>0&&a[i].f==0)
		{
			int sth=dfs(a[i].v,min(res,a[i].w));
			a[i].w-=sth;
			a[i^1].w+=sth;
			res-=sth;
		}
		if(res==0)break;
	}
	return nf-res;
}
void zengguang()
{
	int now=0;
    for(int i=1;i<=n;i++)vis[i]=false;
    while((now=dfs(s,inf))!=0)
	{
        maxflow+=now;
        mincost+=now*delta;
    }
    //printf("!!!%lld %lld\n",maxflow,mincost);
}
void primaldual()
{
	if(!spfa())return;
	reduce();
	zengguang();
	while(dijkstra())
	{
		reduce();
		zengguang();
	}
}
signed main()
{
	int x,y,z,f;
	n=read();
	m=read();
	s=1;
	t=n;
	for(int i=1;i<=m;i++)
	{
		x=read();
		y=read();
		z=read();
		f=read();
		addb(x,y,z,f);
		addb(y,x,0,-f);
	}
	primaldual();
	printf("%lld %lld\n",maxflow,mincost);
	return 0;
}