#include <bits/stdc++.h>
#define int long long
using namespace std;
namespace mcmf {
constexpr int N = 5005, inf = 1e18;
int n, S, T;
struct edge { int v, f, c, rev; };
vector<edge> e[N];
void add(int u, int v, int f, int c) {
	e[u].push_back({v, f, c, (int) e[v].size()});
	e[v].push_back({u, 0, -c, (int) e[u].size() - 1});
}
bool vis[N];
int dis[N], h[N], level[N];
void spfa() {
	queue<int> q;
	q.push(S);
	for (int i = 1; i <= n; i++) {
		vis[i] = 0;
		h[i] = inf;
	}
	h[S] = 0;
	while (q.size()) {
		int u = q.front();
		q.pop();
		vis[u] = 0;
		for (auto [v, f, c, rev] : e[u]) {
			if (f && h[v] > h[u] + c) {
				h[v] = h[u] + c;
				if (!vis[v]) vis[v] = 1, q.push(v);
			}
		}
	}
}
bool dij() {
	priority_queue<array<int, 2>, vector<array<int, 2>>, greater<>> q;
	for (int i = 1; i <= n; i++) {
		vis[i] = 0;
		dis[i] = inf;
		level[i] = -1;
	}
	q.push({dis[S] = 0, S});
	while (!q.empty()) {
		int u = q.top()[1];
		q.pop();
		if (vis[u]) continue;
		vis[u] = 1;
		for (auto [v, f, c, rev] : e[u]) {
			if (f && dis[v] > dis[u] + c + h[u] - h[v]) {
				q.push({dis[v] = dis[u] + c + h[u] - h[v], v});
			}
		}
	}
	queue<int> Q;
	Q.push(S);
	level[S] = 0;
	while (!Q.empty()) {
		int u = Q.front();
		Q.pop();
		for (auto [v, f, c, rev] : e[u]) {
			if (f && dis[v] == dis[u] + c + h[u] - h[v] && level[v] == -1) {
				level[v] = level[u] + 1;
				Q.push(v);
			}
		}
	}
	return dis[T] != inf;
}
int cur[N];
int dinic(int u, int limit) {
	if (u == T) return limit;
	int flow = 0;
	for (; cur[u] && flow < limit; cur[u]--) {
		auto &[v, f, c, rev] = e[u][cur[u] - 1];
		if (f && h[v] == h[u] + c && level[v] == level[u] + 1) {
			int fl = dinic(v, min(limit - flow, f));
			f -= fl;
			e[v][rev].f += fl;
			flow += fl;
			if (!fl) level[v] = -1;
			if (flow == limit) return flow;
		}
	}
	return flow;
}
pair<int, int> flow() {
	int flow = 0, cost = 0;
	// spfa();
	while (dij()) {
		for (int i = 1; i <= n; i++) {
			h[i] = min(h[i] + dis[i], inf);
			cur[i] = e[i].size();
		}
		int f = dinic(S, inf);
		flow += f;
		cost += f * h[T];
	}
	return {flow, cost};
}
}
signed main() {
	int m;
	cin >> mcmf::n >> m;
	mcmf::S = 1, mcmf::T = mcmf::n;
	for (int i = 1, u, v, f, c; i <= m; i++) {
		cin >> u >> v >> f >> c;
		mcmf::add(u, v, f, c);
	}
	auto [flow, cost] = mcmf::flow();
	cout << flow << " " << cost << "\n";
	return 0;
}