#include<cstdio>
#include<algorithm>
#include<queue>
#define fo(i,x,y) for(int i = x;i <= y;++i)
#define fd(i,x,y) for(int i = x;i >= y;--i)
#define _is 1048576
#define gc() ib[++bi]
#define inf 100000000000ll
#define ll long long
#define P pair<ll,int>
using namespace std;
char ib[_is];int bi = -1;
int rd()
{
	int x = 0;char ch = gc();
	while(ch < 48 || ch > 57) ch = gc();
	while(ch >= 48 && ch <= 57) x = x * 10 + ch - 48,ch = gc();
	return x;
}
int n,m,x,y,z,t,e[30010][5],lst[410],tot,L[410],ans;
ll d[410],h[410];
bool vs[410];
void add(int x,int y,int z,int t)
{
	e[++tot][0] = y,e[tot][1] = z,e[tot][3] = t,e[tot][4] = lst[x],lst[x] = tot;
	e[++tot][0] = x,e[tot][1] = 0,e[tot][3] = -t,e[tot][4] = lst[y],lst[y] = tot;
}
bool dij()
{
	fo(i,1,n) vs[i] = 0,d[i] = inf;
	priority_queue<P,vector<P>,greater<P>> Q;
	d[1] = 0,Q.push(P(0,1));
	while(Q.size())
	{
		int w = Q.top().second;Q.pop();
		if(vs[w]) continue;
		vs[w] = 1;
		for(int i = lst[w];i;i = e[i][4])
		{
			int v = e[i][0];
			if(e[i][1] > e[i][2] && d[v] > d[w] + e[i][3] + h[w] - h[v]) d[v] = d[w] + e[i][3] + h[w] - h[v],Q.push(P(d[v],v));
		}
	}
	fo(i,1,n) vs[i] = 0;
	return d[n] != inf;
}
ll dfs(int x,ll fl)
{
	if(x == n) return fl;
	vs[x] = 1;
	ll F = 0;
	for(int &i = L[x];i;i = e[i][4])
	{
		int v = e[i][0];
		if(e[i][1] <= e[i][2] || vs[v] || d[v] != d[x] + e[i][3] + h[x] - h[v]) continue;
		ll nw = dfs(v,min(fl,(ll)(e[i][1] - e[i][2])));
		if(nw <= 0) continue;
		e[i][2] += nw,e[i ^ 1][2] -= nw,fl -= nw,F += nw,ans += nw * e[i][3];
		if(fl == 0) break;
	}
	vs[x] = 0;
	return F;
}
int main()
{
	fread(ib,1,_is,stdin);
	n = rd(),m = rd(),tot = 1;
	fo(i,1,m) x = rd(),y = rd(),z = rd(),t = rd(),add(x,y,z,t);
	ll re = 0;
	while(dij())
	{
		fo(i,1,n) L[i] = lst[i];
		re += dfs(1,inf);
		fo(i,1,n) h[i] += d[i];
	}
	printf("%lld %lld\n",re,ans);
}