// Author: lycc
// Problem: #102. 最小费用流
// Contest: LibreOJ
// URL: https://loj.ac/p/102
// Memory Limit: 256 MB
// Time Limit: 4000 ms
// 
// NOIp 2024 rp++
// 
// 2024 Grand Master

#include<bits/stdc++.h>
#define int long long
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define pb emplace_back
#define For(i, x, y) for (int i = (x); i <= (y); i++)
#define rep(i, x, y) for (int i = (x); i >= (y); i--)
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define ull unsigned long long
#define uint unsigned int
#define ls (p << 1)
#define rs (p << 1 | 1)
#define mp make_pair
#define i128 __int128
#define db long double
#define vi vector<int>
using namespace std;
mt19937_64 rnd(time(0));
template< typename T > void cmin(T &x, T y) { return x = min(x, y), void(); }
template< typename T > void cmax(T &x, T y) { return x = max(x, y), void(); }
int ksm(int x, int y, int p) {
    int v = 1; x %= p;
    while (y) v = 1ll * v * ((y & 1) ? x : 1) % p, x = 1ll * x * x % p, y >>= 1;
    return (v % p + p) % p;
}
bool MemoryST;
const int N = 405, M = 3e4 + 5;
const int mod = 998244353;
const long long INF = 1e18;
int n, m, s, t, tot = 1;
int d[N], head[N], ver[M], nex[M], w[M], cur[N], cost[M];
int minn = 0;
void add(int x, int y, int z, int c) {
	ver[++tot] = y; nex[tot] = head[x]; head[x] = tot; w[tot] = z; cost[tot] = c; return;
}
bool flag[N], vis[N];
bool bfs() {
	For (i, 1, n) d[i] = INF, cur[i] = head[i];
	d[s] = 0; queue<int> qu; qu.push(s);
	while (!qu.empty()) {
		int x = qu.front(); qu.pop(); flag[x] = 0;
		for (int i = head[x]; i; i = nex[i]) {
			int y = ver[i];
			if (w[i] && d[y] > d[x] + cost[i]) {
				d[y] = d[x] + cost[i];
				if (!flag[y]) qu.push(y), flag[y] = 1;
			}
		}
	}
	return d[t] < INF;
}
int dinic(int x, int flow) {
	if (x == t) return flow;
	vis[x] = 1;
	int now = flow;
	for (int i = cur[x]; i; i = nex[i]) {
		cur[x] = i; int y = ver[i];
		if (!vis[y] && d[y] == d[x] + cost[i] && w[i]) {
			int v = dinic(y, min(w[i], now));
			now -= v; w[i] -= v; w[i ^ 1] += v; minn += cost[i] * v;
			if (!now) break;
		}
	}
	vis[x] = 0;
	return flow - now;
}
void solve() {
	cin >> n >> m; s = 1; t = n;
	For (i, 1, m) {
		int x, y, z, c; cin >> x >> y >> z >> c;
		add(x, y, z, c); add(y, x, 0, -c);
	}
	int ans = 0;
	while (bfs()) ans += dinic(s, INF);
	cout << ans << ' ' << minn;
	return;
}
bool MemoryED;
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cerr << fixed << setprecision(6) << (&MemoryST - &MemoryED) / 1048576.0 << "MB\n";
    int TESTCNT = 1;
    //cin >> TESTCNT;
    while (TESTCNT--) solve();
    cerr << endl << 1e3 * clock() / CLOCKS_PER_SEC << "ms"; 
    return 0;
}