#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9;
const ll INF = 1e15;
const int N = 1e5;
inline int read() {
	int s = 0,f = 1;char ch = getchar();
	while (!isdigit(ch)) f = ch == '-' ? -1 : 1, ch = getchar();
	while (isdigit(ch)) s = (s << 3) + (s << 1) + ch - '0', ch = getchar();
	return s*f;
}
int n,m,head[N + 10],cnt = 1;
struct edge {
	int v,w,f,nxt;
}ed[N * 2 + 10];
void add(int u,int v,int w,int f) {
	ed[++cnt] = {v,w,f,head[u]};
	head[u] = cnt;
}
void add_(int u,int v,int w,int f) {
	add(u,v,w,f), add(v,u,-w,0);
}
int h2[N + 10],S,T,vis[N + 10];
ll dis[N + 10],minans = 0;
bool spfa() {
	for (int i = 1;i <= n;i ++ ) dis[i] = INF, vis[i] = 0;
	dis[S] = 0;
	queue<int> q;
	q.push(S);
	while (!q.empty()) {
		int u = q.front();q.pop();
		vis[u] = 0;
		for (int i = head[u];i;i = ed[i].nxt) {
			int v = ed[i].v;
			if (ed[i].f && dis[v] > dis[u] + ed[i].w) {
				dis[v] = dis[u] + ed[i].w;
				if (!vis[v]) vis[v] = 1, q.push(v);
			}
		}
	}
	return dis[T] != INF;
}
int dfs(int x,int fl) {
	if (x == T) return fl;
	vis[x] = 1;
	int tmp = 0;
	for (int i = head[x];i;i = ed[i].nxt) {
		int v = ed[i].v;
		if (vis[v] || dis[v] != dis[x] + ed[i].w || !ed[i].f) continue;
		int vfl = dfs(v,min(ed[i].f,fl - tmp));
		ed[i ^ 1].f += vfl, ed[i].f -= vfl;
		minans += vfl * ed[i].w;
		tmp += vfl;
		if (tmp == fl) return fl;
	}
	vis[x] = 0;
	return tmp;
}
int main() {
	n = read(), m = read(), S = 1, T = n;
	for (int i = 1;i <= m;i ++ ) {
		int u = read(),v = read(),f = read(),w = read();
		add_(u,v,w,f);
	}
	int ans = 0;
	while (spfa()) {
//		cout << 233;
		memset(vis,0,sizeof vis);
		ans += dfs(S,2147483647);
	}
	cout << ans << ' ' << minans;
	return 0;
}