#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
const int N = 410, M = 30010, inf = 2147483647;
bool vis[N];
int n, m, sum, ans;
int que[M << 2], head[N], dis[N], fr[N], to[M], flow[M], cost[M], nxt[M];
int read() {
	int res;
	char ch;
	while (!isdigit(ch = getchar()));
	res = ch - '0';
	while (isdigit(ch = getchar()))
		res = res * 10 + (ch - '0');
	return res;
}
int main() {
	n = read();
	m = read();
	for (int i = 1; i <= m; ++i) {
		int u, v, c, w;
		u = read();
		v = read();
		c = read();
		w = read();
		to[i << 1] = v;
		flow[i << 1] = c;
		cost[i << 1] = w;
		nxt[i << 1] = head[u];
		head[u] = i << 1;
		to[i << 1 | 1] = u;
		flow[i << 1 | 1] = 0;
		cost[i << 1 | 1] = -w;
		nxt[i << 1 | 1] = head[v];
		head[v] = i << 1 | 1;
	}
	while (1) {
		for (int i = 1; i <= n; ++i)
			dis[i] = inf;
		que[1] = 1;
		dis[1] = 0;
		for (int i = 1, j = 1; i <= j; ++i) {
			int x = que[i];
			vis[x] = 0;
			for (int k = head[x]; k; k = nxt[k])
				if (flow[k] && dis[to[k]] > dis[x] + cost[k]) {
					dis[to[k]] = dis[x] + cost[k];
					fr[to[k]] = k;
					if (!vis[to[k]]) {
						que[++j] = to[k];
						vis[to[k]] = 1;
					}
				}
		}
		if (dis[n] == inf)
			break;
		int mn = inf;
		for (int i = n; i ^ 1; i = to[fr[i] ^ 1])
			mn = min(mn, flow[fr[i]]);
		for (int i = n; i ^ 1; i = to[fr[i] ^ 1]) {
			flow[fr[i]] -= mn;
			flow[fr[i] ^ 1] += mn;
		}
		sum += mn;
		ans += mn * dis[n];
	}
	printf("%d %d", sum, ans);
	return 0;
}