#include <bits/stdc++.h>
#define PB push_back
#define EB emplace_back
using namespace std;
const int maxn = 400;
struct edge { int v, f, c; };
vector<edge> e;
vector<int> g[maxn + 5];
inline void addE(int u, int v, int w, int c) {
	g[u].PB(e.size()), e.PB({v, w, c});
	g[v].PB(e.size()), e.PB({u, 0, -c});
}
int dis[maxn + 5];
int fl[maxn + 5];
bool inq[maxn + 5];
int lst[maxn + 5];
bool SPFA(int s, int t) {
	memset(dis, 127, sizeof(dis));
	memset(inq, 0, sizeof(inq));
	queue<int> q;
	inq[s] = 1, q.push(s);
	dis[s] = 0, fl[s] = 1E9;
	while (!q.empty()) {
		int u = q.front(); q.pop();
		inq[u] = 0;
		for (int eid : g[u]) {
			int v = e[eid].v, f = e[eid].f, c = e[eid].c;
			if (f && dis[v] > dis[u] + c) {
				dis[v] = dis[u] + c;
				fl[v] = min(fl[u], f);
				lst[v] = eid;
				if (!inq[v]) inq[v] = 1, q.push(v);
			}
		}
	}
	return dis[t] != 0x7F7F7F7F;
}
pair<int, int> EK(int s, int t) {
	int F = 0, C = 0;
	while (SPFA(s, t)) {
		F += fl[t], C += dis[t] * fl[t];
		int u = t;
		while (u != s) {
			int eid = lst[u];
			e[eid].f -= fl[t], e[eid ^ 1].f += fl[t];
			u = e[eid ^ 1].v;
		}
	}
	return {F, C};
}
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);
		addE(u, v, w, c);
	}
	int F, C; tie(F, C) = EK(1, n);
	printf("%d %d", F, C);
}