#include<bits/stdc++.h>
#define int ll
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define qr read()
#define in(x) x=read()
#define nc getchar
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
inline ll read()
{
	char ch=' ';
	ll f=1,x=0;
	for(;!isdigit(ch);ch=nc())if(ch=='-')f*=-1;
	for(;isdigit(ch);ch=nc())x=x*10+ch-'0';
	return f*x;
}
vector<int>e[1000010];
struct edge
{
	int v,w,c;
};
int n,m,s,t,dis[1000010],h[1000010],vis[1000010];
vector<edge>eg;
queue<int>q;
void add(int x,int y,int z,int c)
{
	e[x].push_back(eg.size());
	eg.push_back((edge){y,z,c});
	e[y].push_back(eg.size());
	eg.push_back((edge){x,0,-c});
}
bool spfa()
{
	for(int i=1;i<=n;i++)dis[i]=1e16,vis[i]=0;
	dis[s]=0,vis[s]=1;
	q.push(s);
	while(!q.empty())
	{
		int now=q.front();q.pop();
		vis[now]=0;
		for(auto i:e[now])
		{
			if(eg[i].w&&dis[eg[i].v]>dis[now]+eg[i].c)
			{
				dis[eg[i].v]=dis[now]+eg[i].c;
				if(!vis[eg[i].v])vis[eg[i].v]=1,q.push(eg[i].v);
			}
		}
	}
	return dis[t]<=1e15;
}
int cost=0,vis2[1000010];
int dfs(int x,int s)
{
	if(x==t)return s;
	int ans=0;
	vis2[x]=1;
	for(int &ii=h[x];ii<e[x].size();ii++)
	{
		int i=e[x][ii];
		if(!eg[i].w||dis[eg[i].v]!=dis[x]+eg[i].c||vis2[eg[i].v])continue;
		int now=dfs(eg[i].v,min(s,eg[i].w));
		cost+=now*eg[i].c;
		s-=now,ans+=now;
		eg[i].w-=now,eg[i^1].w+=now;
		if(!s)break;
	}
	vis2[x]=0;
	return ans;
}
int flow()
{
	int ans=0;
	while(spfa())
	{
		memset(h,0,sizeof(int)*(n+1));
		ans+=dfs(s,1e16);
	}
	return ans;
}
signed main()
{
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	n=qr,m=qr;
	s=1,t=n;
	for(int i=1;i<=m;i++)
	{
		int x=qr,y=qr,z=qr,c=qr;
		add(x,y,z,c);
	}
	int ans=flow();
	cout<<ans<<' '<<cost;
	return 0;
}