#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m, S, T;
int head[410], cur[410], vis[410], dis[410], pre[410], cnt = 1;
struct edge {
	int v, nxt, c, w;
} e[30010];
void addedge(int u, int v, int c, int w) {
	e[++cnt] = {v, head[u], c, w}, head[u] = cnt;
	e[++cnt] = {u, head[v], 0, -w}, head[v] = cnt;
}
bool SPFA() {
	memcpy(cur, head, sizeof(head));
	memset(vis, 0, sizeof(vis));
	memset(dis, 0x3f, sizeof(dis));
	queue<int> q;
	q.push(S), vis[S] = 1, dis[S] = 0;
	while (!q.empty()) {
		int u = q.front(); q.pop(), vis[u] = 0;
		for (int i = head[u]; i; i = e[i].nxt) {
			if (!e[i].c || dis[e[i].v] <= dis[u] + e[i].w) continue;
			dis[e[i].v] = dis[u] + e[i].w, pre[e[i].v] = i;
			if (!vis[e[i].v]) q.push(e[i].v), vis[e[i].v] = 1;
		}
	}
	return dis[T] <= 1e18;
}
pair<int, int> getpath() {
	int now = T, flow = 1e18, cost = 0;
	while (now != S)
		flow = min(flow, e[pre[now]].c), now = e[pre[now] ^ 1].v;
	now = T;
	while (now != S) {
		cost += flow * e[pre[now]].w;
		e[pre[now]].c -= flow, e[pre[now] ^ 1].c += flow;
		now = e[pre[now] ^ 1].v;
	}
	return {flow, cost};
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> m, S = 1, T = n;
	for (int i = 1; i <= m; i++) {
		int u, v, c, w;
		cin >> u >> v >> c >> w;
		addedge(u, v, c, w);
	}
	pair<int, int> res(0, 0);
	while (SPFA()) {
		auto tmp = getpath();
		res.first += tmp.first, res.second += tmp.second;
	}
	cout << res.first << ' ' << res.second << '\n';
	return 0;
}