#include <stdio.h>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;

const int INF = 2147483647;

const int NR = 400 + 10, MR = 15000 + 10;

int n, m, S, T;
int dis[NR], frE[NR], frV[NR];
int mxf = 0, mnc = 0;
bool inQ[NR];

int ecnt = 1, first[NR];
struct Edge {
	int to, nxt, w, c;
} e[MR * 2];

void addE(int u, int v, int w, int c) {
	e[++ecnt] = {v, first[u], w, c};
	first[u] = ecnt;
}

bool spfa() {
	queue<int> q;
	for (int i = 1; i <= n; i++) dis[i] = INF, inQ[i] = 0, frE[i] = frV[i] = -1;
	q.push(S), dis[S] = 0, inQ[S] = 1;
	while (!q.empty()) {
		int now = q.front(); q.pop();
		inQ[now] = 0;
		for (int i = first[now]; i; i = e[i].nxt) {
			int t = e[i].to;
			if (e[i].w && dis[t] > dis[now] + e[i].c) {
				dis[t] = dis[now] + e[i].c, frE[t] = i, frV[t] = now;
				if (!inQ[t]) q.push(t), inQ[t] = 1;
			}
		}
	}
	return frV[T] != -1;
}

void EK() {
	while (spfa()) {
		int flow = INF, cur = T;
		while (frE[cur] != -1) flow = min(flow, e[frE[cur]].w), cur = frV[cur];
		mxf += flow, mnc += flow * dis[T];
		cur = T;
		while (frE[cur] != -1) e[frE[cur]].w -= flow, e[frE[cur] ^ 1].w += flow, cur = frV[cur];
	}
}

int main()
{
#ifdef WYZ
	freopen("1.in", "r", stdin);
	freopen("1.out", "w", stdout);
#endif
	ios::sync_with_stdio(0);
	
	cin >> n >> m;
	S = 1, T = n;
	for (int i = 1; i <= m; i++) {
		int u, v, w, c; cin >> u >> v >> w >> c;
		addE(u, v, w, c), addE(v, u, 0, -c);
	}

	EK();
	cout << mxf << ' ' << mnc << '\n';

	return 0;
}