#include <bits/stdc++.h>
#define ll long long
#define pir pair <ll, ll>
#define mkp make_pair
#define fi first
#define se second
#define pb push_back
using namespace std;
const ll maxn = 3e4 + 10;
ll n, m, s, t, head[maxn], tot = 1, cur[maxn];
queue <ll> q;
struct edge { ll v, w, c, nxt; } e[maxn];
void insert(ll u, ll v, ll w, ll c) {
	e[++tot] = (edge) {v, w, c, head[u]};
	head[u] = tot;
	e[++tot] = (edge) {u, 0, -c, head[v]};
	head[v] = tot;
}
ll dis[maxn], vis[maxn];
bool spfa() {
	for(ll i = 1; i <= n; i++) dis[i] = 1e18;
	q.push(s);
	dis[s] = 0;
	while(!q.empty()) {
		ll u = q.front(); q.pop(), vis[u] = 0;
		for(ll i = head[u]; i; i = e[i].nxt) {
			ll v = e[i].v, w = e[i].w, c = e[i].c;
			if(w && dis[v] > dis[u] + c) {
				dis[v] = dis[u] + c;
				if(!vis[v]) vis[v] = 1, q.push(v);
			}
		}
	} return dis[t] < 1e17;
}
ll dfs(ll u, ll flow) {
	if(u == t) return flow;
	ll used = 0; vis[u] = 1;
	for(ll i = cur[u]; i; cur[u] = i = e[i].nxt) {
		ll v = e[i].v, w = e[i].w;
		if(w && dis[v] == dis[u] + e[i].c && !vis[v]) {
			ll tmp = dfs(v, min(w, flow - used));
			used += tmp;
			e[i].w -= tmp, e[i ^ 1].w += tmp;
			if(used == flow) break;
		}
	} vis[u] = 0; return used;
}
int main(){
	scanf("%lld%lld", &n, &m);
	s = 1, t = n;
	for(ll i = 1; i <= m; i++) {
		ll u, v, w, c;
		scanf("%lld%lld%lld%lld", &u, &v, &w, &c);
		insert(u, v, w, c);
	}
	ll ret = 0;
	while(spfa()) {
		for(ll i = 1; i <= n; i++) cur[i] = head[i];
		ret += dfs(s, 1e18);
	} printf("%lld ", ret);
	ret = 0;
	for(ll i = 3; i <= tot; i += 2) ret -= e[i].c * e[i].w;
	printf("%lld", ret);
	return 0;
}