#include <stdio.h>
#include <string.h>
#include <algorithm>
#define sz 405
using namespace std;
struct site
{
	int ed, next, wei, fee;
};
int n, m, ans, fee, now = 1;
bool vis[sz];
int fsl[sz], dep[sz], que[1000005];
site dld[300005];
int read();
void net(int, int, int, int);
bool bfs();
int dfs(int, int);
int main()
{
	int x, y, c, d;
	n = read(); m = read();
	for (int i = 1; i <= m; ++i)
	{
		x = read(); y = read();
		c = read(); d = read();
		net(x, y, c, d); net(y, x, 0, -d);
	}
	while (bfs())
		ans += dfs(1, 1e9);
	printf ("%d %d\n", ans, fee);
	return 0;
}

int read()
{
	int x = 0;
	char c = getchar();
	while (c < '0') c = getchar();
	do {
		x = x * 10 + (c & 15);
		c = getchar();
	}while (c >= '0');
	return x;
}

void net(int a, int b, int w, int f)
{
	dld[++now].ed = b;
	dld[now].next = fsl[a];
	dld[now].wei = w;
	dld[now].fee = f;
	fsl[a] = now;
}

bool bfs()
{
	memset(vis + 1, 0, n);
	memset(dep + 1, 0x3f, n << 2);
	int tp = 1, tl = 1;
	que[1] = 1; vis[1] = true;
	dep[1] = 0;
	while (tp >= tl)
	{
		int x = que[tl++];
		vis[x] = false;
		for (int i = fsl[x]; i; i = dld[i].next)
			if (dld[i].wei && dep[dld[i].ed] > dep[x] + dld[i].fee)
			{
				dep[dld[i].ed] = dep[x] + dld[i].fee;
				if (!vis[dld[i].ed])
				{
					que[++tp] = dld[i].ed;
					vis[dld[i].ed] = true;
				}
			}
	}
	return dep[n] != 0x3f3f3f3f;
}

int dfs(int a, int b)
{
	if (a == n)
		return b;
	int yf = b, tmp;
	vis[a] = true;
	for (int i = fsl[a]; i; i = dld[i].next)
		if (dld[i].wei && (!vis[dld[i].ed]) && dep[dld[i].ed] == dep[a] + dld[i].fee)
		{
			tmp = dfs(dld[i].ed, min(b, dld[i].wei));
			dld[i].wei -= tmp;
			dld[i ^ 1].wei += tmp;
			b -= tmp;
			fee += tmp * dld[i].fee;
			if (!b)
				break;
		}
	return yf - b;
}