#include <bits/stdc++.h>
using namespace std;
#define int long long
struct MCF {
	static constexpr int N = 5005;
	struct edge {
		int v, rev, f, c;
	};
	vector<edge> e[N];
	void add(int u, int v, int f, int c) {
		e[u].push_back({v, (int) e[v].size(), f, c});
		e[v].push_back({u, (int) e[u].size() - 1, 0, -c});
	}
	int dis[N], h[N];
	int lim[N];
	array<int, 3> pre[N];
	bool bfs(int S, int T) {
		memset(dis, 0x3f, sizeof dis);
		memset(lim, 0x3f, sizeof lim);
		priority_queue<array<int, 2>, vector<array<int, 2>>, greater<>> Q;
		Q.push({dis[S] = 0, S});
		while (!Q.empty()) {
			auto [d, u] = Q.top();
			Q.pop();
			if (d != dis[u]) continue;
			for (int i = 0; i < e[u].size(); i++) {
				auto [v, rev, f, c] = e[u][i];
				if (f && dis[v] > dis[u] + h[u] - h[v] + c) {
					lim[v] = min(lim[u], f);
					Q.push({dis[v] = dis[u] + h[u] - h[v] + c, v});
					pre[v] = {u, i, rev};
				}
			}
		}
		return dis[T] < 1e18;
	}
	pair<int, int> flow(int S, int T) {
		int rf = 0, rc = 0;
		while (bfs(S, T)) {
			for (int i = 0; i < N; i++) {
				h[i] = min(h[i] + dis[i], (int) 1e18);
			}
			int fl = lim[T];
			for (int v = T; v != S; ) {
				int u = pre[v][0];
				e[u][pre[v][1]].f -= fl;
				e[v][pre[v][2]].f += fl;
				v = u;
			}
			rf += fl, rc += fl * h[T];
		}
		return {rf, rc};
	}
} G;
signed main() {
	int n, m;
	cin >> n >> m;
	for (int i = 1, u, v, f, c; i <= m; i++) {
		cin >> u >> v >> f >> c;
		G.add(u, v, f, c);
	}
	auto [f, c] = G.flow(0, n - 1);
	cout << f << " " << c << "\n";
	return 0;
}