#include <bits/stdc++.h>
using namespace std;
const int MAXN = 405;
const int MAXM = 15005;
struct edge {int to, val, co, nxt;} edges[MAXM << 1]; int head[MAXN], tot = 1;
void add(int u, int v, int w, int c) {
	edges[++tot].to = v; edges[tot].nxt = head[u]; edges[tot].co = c; edges[tot].val = w;
	head[u] = tot;
}
long long hei[MAXN], dis[MAXN]; int fe[MAXN], flw[MAXN]; bool vis[MAXN];
void spfa(int s) {
	memset(dis, 0x3f, sizeof dis); queue<int> q; dis[s] = 0; q.push(s); while (q.empty() == 0) {
		int u = q.front(); q.pop(); vis[u] = 0; for (int i = head[u]; i; i = edges[i].nxt) {
			if (edges[i].val && dis[edges[i].to] > dis[u] + edges[i].co) {
				dis[edges[i].to] = dis[u] + edges[i].co;
				if (vis[edges[i].to] == 0) vis[edges[i].to] = 1, q.push(edges[i].to);
			}
		}
	}
}
bool dijk(int s, int t) {
	memset(dis, 0x3f, sizeof dis); memset(vis, 0, sizeof vis);
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> pq;
	pq.push({dis[s] = 0, s}); flw[s] = 0x7fffffff; while (pq.empty() == 0) {
		int u = pq.top().second; pq.pop(); if (vis[u]) continue; vis[u] = 1;
		for (int i = head[u]; i; i = edges[i].nxt) {
			if (edges[i].val && dis[edges[i].to] > dis[u] + edges[i].co + hei[u] - hei[edges[i].to]) {
				dis[edges[i].to] = dis[u] + edges[i].co + hei[u] - hei[edges[i].to];
				flw[edges[i].to] = min(flw[u], edges[i].val); fe[edges[i].to] = i;
				pq.push({dis[edges[i].to], edges[i].to});
			}
		}
	}
	return vis[t];
}
void mcmf(int s, int t, int n) {
	spfa(s); for (int i = 1; i <= n; i++) hei[i] = dis[i];
	long long fl = 0, co = 0;
	while (dijk(s, t)) {
		fl += flw[t]; co += (dis[t] + hei[t]) * flw[t];
		int T = t; while (T != s) {
			edges[fe[T]].val -= flw[t];
			edges[fe[T] ^ 1].val += flw[t];
			T = edges[fe[T] ^ 1].to;
		}
		for (int i = 1; i <= n; i++) hei[i] += dis[i];
	}
	printf("%lld %lld\n", fl, co);
}
int main() {
	int n, m; scanf("%d %d", &n, &m);
	for (int i = 1; i <= m; i++) {
		int u, v, w, c; scanf("%d %d %d %d", &u, &v, &w, &c);
		add(u, v, w, c); add(v, u, 0, -c);
	}
	mcmf(1, n, n);
}