#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define R(i, x, y) for (int i = (x); i >= (y); i--)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
bool Mbe;

const int N = 405;
const int M = 2e4 + 5;
const int inf = 0x3f3f3f3f;

struct E {
	int to, nxt, w, c;
} e[M << 1];

int n, m, tot;
int hd[N], cr[N], d[N], vs[N];

void add_edge(int u, int v, int w, int c) {
	e[++tot] = (E) { v, hd[u], w, c };
	hd[u] = tot;
}

void add_flow(int u, int v, int w, int c) {
	add_edge(u, v, w, c);
	add_edge(v, u, 0, -c);
}

bool spfa() {
	memset(d, inf, sizeof(d));
	queue<int> q;
	q.push(1), d[1] = 0;
	while (!q.empty()) {
		int u = q.front(); 
		q.pop(), vs[u] = 0;
		for (int i = hd[u]; i; i = e[i].nxt) {
			int v = e[i].to, w = e[i].w, c = e[i].c;
			if (!w) {
				continue;
			}
			if (d[v] > d[u] + c) {
				d[v] = d[u] + c;
				if (!vs[v]) {
					q.push(v);
					vs[v] = 1;
				}
			}
		}
	}
	return d[n] != inf;
}

int dfs(int u, int in) {
	if (u == n) {
		return in;
	}
	int out = 0;
	vs[u] = 1;
	for (int &i = cr[u]; i; i = e[i].nxt) {
		int v = e[i].to, w = e[i].w, c = e[i].c;
		if (!vs[v] && d[v] == d[u] + c && w) {
			int res = dfs(v, min(in, w));
			in -= res, out += res;
			e[i].w -= res, e[i ^ 1].w += res;
		}
		if (!in) {
			break;
		}
	}
	vs[u] = 0;
	return out;
}

void solve() {
	cin >> n >> m, tot = 1;
	F (i, 1, m) {
		int u, v, w, c;
		cin >> u >> v >> w >> c;
		add_flow(u, v, w, c);
	}
	int mc = 0, mf = 0;
	while (spfa()) {
		memcpy(cr, hd, sizeof(hd));
		int res = dfs(1, inf);
		mc += res * d[n], mf += res;
	}
	cout << mf << ' ' << mc << '\n';
}

bool Med;
int main() {
	// FIO("");
	// ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}