#include<bits/stdc++.h>
#define N 405
#define M 15005
#define int long long
using namespace std;
int n, m, head[N], tot = 1, cur[N], ret, vis[N], dis[N], seq[20000005], L, R, mk[N];
struct edge{
	int to, cap, cst, nxt;
}e[M << 1];
void add(int x, int y, int z, int w)
{
	e[++tot] = {y, z, w, head[x]};
	head[x] = tot;
	e[++tot] = {x, 0, -w, head[y]};
	head[y] = tot;
}
bool SPFA()
{
	memset(vis, 0, sizeof(vis));
	memset(dis, 0x3f, sizeof(dis));
	dis[1] = 0;
	L = R = 0;
	seq[++R] = 1;
	while(L < R)
	{
		int x = seq[++L];
		vis[x] = 0;
		for(int i = head[x]; ~i; i = e[i].nxt)
		{
			if(e[i].cap && dis[e[i].to] > dis[x] + e[i].cst)
			{
				dis[e[i].to] = dis[x] + e[i].cst;
				if(!vis[e[i].to]) vis[e[i].to] = 1, seq[++R] = e[i].to;
			}
		}
	}
	return (dis[n] <= 1e15);
}
int dfs(int x, int fl)
{
	if(x == n && fl) return fl;
	// cout << x << " " << fl << endl;
	int rm = fl;
	mk[x] = 1;
	for(int &i = cur[x]; ~i && rm; i = e[i].nxt)
	{
		// cout << i << endl;
		if(!mk[e[i].to] && dis[e[i].to] == dis[x] + e[i].cst && e[i].cap)
		{
			int Flow = dfs(e[i].to, min(rm, e[i].cap));
			if(Flow) ret += e[i].cst * Flow, e[i].cap -= Flow, e[i ^ 1].cap += Flow, rm -= Flow;
		}
	}
	mk[x] = 0;
	return fl - rm;
}
void Dinic()
{
	int ans = 0;
	while(SPFA())
	{
		// cout << dis[n] << endl;
		for(int i = 1; i <= n; i++) cur[i] = head[i];
		while(1)
		{
			int w = dfs(1, 1e18);
			if(!w) break;
			ans += w;
			// cout << ans << " " << ret << endl;
		}
	}
	printf("%lld %lld\n", ans, ret);
}
signed main()
{
	memset(head, -1, sizeof(head));
	scanf("%lld%lld", &n, &m);
	for(int i = 1, x, y, z, w; i <= m; i++) scanf("%lld%lld%lld%lld", &x, &y, &z, &w), add(x, y, z, w);
	Dinic();
	return 0;
}