//qoj602
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 410, M = 3e4 + 10;
const ll inf = 1e11;
int n, m, s, t;
int hd[N], eg[M], nx[M], tot = 1;
ll ln[M], cs[M], dep[N], mf, mc;
int now[N], vis[N];

void add(int u, int v, int w, int c){
	eg[++tot] = v;
	ln[tot] = w;
	cs[tot] = c;
	nx[tot] = hd[u];
	hd[u] = tot;
}
bool spfa(int s, int t){
	queue<int> q;
	memset(dep, 0x3f, sizeof(dep));
	memset(vis, 0, sizeof(vis));
	memcpy(now, hd, sizeof(hd));
	q.push(s);
	dep[s] = 0;
	vis[s] = 1;
	while(!q.empty()){
		int x = q.front();
		q.pop();
		vis[x] = 0;
		for(int i = hd[x]; i; i = nx[i]){
			int y = eg[i];
			ll z = ln[i], c = cs[i];
			if(z && dep[y] > dep[x] + c){
				dep[y] = dep[x] + c;
				if(!vis[y]){
					q.push(y);
					vis[y] = 1;
				}
			}
		}
	}
	return dep[t] != 0x3f3f3f3f3f3f3f3f;
}
ll dfs(int x, int t, ll fl){
	if(x == t){
		return fl;
	}
	ll rs = fl;
	vis[x] = 1;
	for(int i = now[x]; i && rs; i = nx[i]){
		int y = eg[i];
		ll z = ln[i], c = cs[i];
		now[x] = i;
		if(!vis[y] && z && dep[y] == dep[x] + c){
			ll k = dfs(y, t, min(rs, z));
			if(!k){
				dep[y] = 0;
			}
			ln[i] -= k;
			ln[i^1] += k;
			rs -= k;
			mc += k * c;
		}
	}
	vis[x] = 0;
	return fl - rs;
}

int main(){
	scanf("%d%d", &n, &m);
	s = 1, t = n;
	for(int i = 1; i <= m; ++ i){
		int u, v, w, c;
		scanf("%d%d%d%d", &u, &v, &w, &c);
		add(u, v, w, c);
		add(v, u, 0, -c);
	}
	ll tmp;
	while(spfa(s, t)){
		while(tmp = dfs(s, t, inf)){
			mf += tmp;
		}
	}
	printf("%lld %lld\n", mf, mc);
	return 0;
}