#include <bits/stdc++.h>
using namespace std;

namespace IO {
	#if ONLINE_JUDGE
	#define getc() (IS == IT && (IT = (IS = ibuf) + fread(ibuf, 1, IL, stdin), IS == IT) ? EOF : *IS++)
	#else
	#define getc() getchar()
	#endif
	const int IL = 1 << 21, OL = 1 << 21;
	int olen = 0;
	char ibuf[IL], *IS = ibuf, *IT = ibuf, obuf[OL];
	inline int read() {
		register char ch = getc(); register int x = 0, f = 1;
		while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getc(); }
		while(isdigit(ch)) x = x * 10 + ch - 48, ch = getc();
		return x * f;
	}
	inline double readdb() {
		register char ch = getc(); register double x = 0, f = 1;
		while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getc(); }
		while(isdigit(ch)) x = x * 10 + ch - 48, ch = getc();
		if(ch == '.') {
			register double b = 0.1;
			ch = getc();
			while(isdigit(ch)) x += (ch - 48) * b, b *= 0.1, ch = getc();
		}
		return x * f;
	}
	inline int readstr(char *s) {
		register char ch = getc(); register int len = 0;
		while(!isalpha(ch)) ch = getc();
		while(isalpha(ch)) s[++len] = ch, ch = getc();
		return len;
	}
	inline void flush() { fwrite(obuf, 1, olen, stdout); olen = 0; }
	inline void putc(register char ch) { obuf[olen++] = ch; }
	template<class T>
	inline void write(register T x) {
		if(x < 0) obuf[olen++] = '-', x = -x;
		if(x > 9) write(x / 10);
		obuf[olen++] = x % 10 + 48;
	}
} using namespace IO;
const int N = 1e2 + 10, M = 5e3 + 10;
int n, m, S, T;
struct edge {
	int to, w, c, nxt;
} e[M << 1];
int head[N], ecnt = 1;
int dis[N];
void addedge(int u, int v, int w, int c) {
	e[++ecnt] = {v, w, c, head[u]};
	head[u] = ecnt;
	e[++ecnt] = {u, 0, -c, head[v]};
	head[v] = ecnt;
}
bool vis[N];
int now[N];
bool spfa() {
	memset(dis, 0x7f, sizeof(dis));
	queue<int> q;
	q.push(S);
	dis[S] = 0;
	while(!q.empty()) {
		int u = q.front();
		q.pop();
		now[u] = head[u];
		vis[u] = 0;
		for(int i = head[u], v; i; i = e[i].nxt) {
			v = e[i].to;
			if(e[i].w && dis[v] > dis[u] + e[i].c) {
				dis[v] = dis[u] + e[i].c;
				if(!vis[v]) vis[v] = 1, q.push(v);
			}
		}
	}
	return dis[T] < 2e9;
}
int mincost;
int dfs(int u, int sum) {
	if(u == T) return sum;
	vis[u] = 1;
	int res = 0, flow;
	for(int i = now[u], v; i; i = e[i].nxt) {
		now[u] = i;
		v = e[i].to;
		if(!vis[v] && dis[v] == dis[u] + e[i].c && e[i].w) {
			flow = dfs(v, min(sum, e[i].w));
			e[i].w -= flow;
			e[i ^ 1].w += flow;
			sum -= flow;
			res += flow;
			mincost += flow * e[i].c;
			if(!sum) break;
		}
	}
	vis[u] = 0;
	if(!res) dis[u] = 2e9;
	return res;
}
int dinic() { int ans = 0; while(spfa()) ans += dfs(S, 2e9); return ans; }
int main() {
	n = read(), m = read(), S = 1, T = n;
	for(int i = 1; i <= m; i++) {
		int u = read(), v = read(), w = read(), c = read();
		addedge(u, v, w, c);
	}
	int ans = dinic();
	printf("%d %d\n", ans, mincost);
	return 0;
}