#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#define int long long
#define endl '\n'
#define lson 2*i
#define rson 2*i+1
#define debug(x) cerr << #x << " = " <<  x << "\n"; 
#define debug2(l,r) cerr << "[" #l "," #r "] = [" << l << "," << r << "]\n";
#define debug3(x,y,z) cerr << "{" #x "," #y "," #z "} = " << "{" << x << "," << y << "," << z << "}\n"; 
#define debugv(v) cerr << #v": size= " << v.size() << "\nelement: " ; for(auto p:v)  cout << p << " ";
using namespace std;
const int N = 455, M = 15055, MOD = 1e9 + 7, INF = 1e18;
int n, m, s, t, head[N], cur[N], d[N], vis[N], cnt = 1, maxf, minc;
struct edge {
	int x, w, c, nxt;
} e[M * 2];
void add(int x, int y, int w, int c) {
	e[++cnt] = {y, w, c, head[x]};
	head[x] = cnt;
}
struct node {
	int x, y;
	node() {}
	node(int _x, int _y) : x(_x), y(_y) {}
};
queue<node> q;
bool bfs() {
	for (int i = 1; i <= n; i++) 
		d[i] = INF, vis[i] = 0;
	q.push({s, 0}), d[s] = 0;
	while (!q.empty()) {
		int x = q.front().x, y = q.front().y;
		q.pop();
		if (y != d[x]) continue;
		cur[x] = head[x];	
		for (int i = head[x]; i; i = e[i].nxt) {
			int u = e[i].x, w = e[i].w, c = e[i].c;
			if (w && c + d[x] < d[u]) {
				d[u] = d[x] + c;
				q.push({u, d[u]});
			}
		}
	}
	return d[t] < INF;
}
int dfs(int x, int flow) {
	if (!flow || x == t) return flow;
	vis[x] = true;
	int sum = 0, f;
	for (int i = cur[x]; i && flow; i = e[i].nxt) {
		cur[x] = i;
		int u = e[i].x, w = e[i].w, c = e[i].c;
		if (!vis[u] && d[u] == d[x] + c && (f = dfs(u, min(flow, w)))) {
			e[i].w -= f, e[i ^ 1].w += f;
			flow -= f, minc += f * c, sum += f;
		} 
	}
	vis[x] = false;
	return sum;
}
signed main() {
	cin.tie(0), ios_base::sync_with_stdio(false);
	cin >> n >> m;
	s = 1, t = n;
	for (int i = 1, x, y, w, c; i <= m; i++) {
		cin >> x >> y >> w >> c;
		add(x, y, w, c), add(y, x, 0, -c);
	}
	while (bfs()) maxf += dfs(s, INF);
	cout << maxf << ' ' << minc << endl;
	return 0;
}