#include <bits/stdc++.h>
#define ms(x, v) memset(x, v, sizeof(x))
#define il __attribute__((always_inline)) static
#define U(i,l,r) for(int i(l),END##i(r);i<=END##i;++i)
#define D(i,r,l) for(int i(r),END##i(l);i>=END##i;--i)
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
template <class T> using BS = basic_string<T>;

template <class T> void rd(T& s) {
	int c = getchar(); T f = 1; s = 0;
	while (!isdigit(c)) { if (c == '-') f = -1; c = getchar(); }
	while (isdigit(c)) { s = s * 10 + (c ^ 48); c = getchar(); }
	s *= f;
}
template <class T, class... Y> void rd(T& x, Y&... y) { rd(x), rd(y...); }
#define meow(...) fprintf(stderr, __VA_ARGS__)

const int N = 405, M = 30005, INF = INT_MAX;
int n, m;
struct Eg { int v, f, c, pre; } eg[M]; int eP = 1, tail[N];
void aE(int u, int v, int f, int c) {
	eg[++eP] = {v, f, c, tail[u]};
	tail[u] = eP;
}
void add(int u, int v, int f, int c) {
	aE(u, v, f, c);
	aE(v, u, 0, -c);
}

int pE[N];
bool spfa() {
	static int dis[N], vis[N]; U (i, 0, n) dis[i] = INF;
	
	pE[1] = 0; vis[1] = 1; dis[1] = 0; queue<int> q; q.push(1);
	while (q.size()) {
		int u = q.front(); q.pop(); vis[u] = 0;
		for (int p = tail[u]; p; p = eg[p].pre) { auto [v, f, c, _] = eg[p];
			if (f && dis[u] != INF && dis[v] > dis[u] + c) {
				dis[v] = dis[u] + c;
				pE[v] = p;
				if (!vis[v]) {
					vis[v] = 1;
					q.push(v);
				}
			}
		}
	}
	return dis[n] != INF;
}
pair<int, int> flow() {
	int ans = 0, fl = 0;
	while (spfa()) {
		int mF = INF, sC = 0;
		for (int u = n; u != 1; u = eg[pE[u] ^ 1].v)
			mF = min(eg[pE[u]].f, mF),
			sC += eg[pE[u]].c;
		ans += mF * sC;
		fl += mF;
		for (int u = n; u != 1; u = eg[pE[u] ^ 1].v)
			eg[pE[u]].f -= mF, eg[pE[u] ^ 1].f += mF;
	}
	return {fl, ans};
}

int main() {
	rd(n, m);
	U (i, 1, m) {
		int u, v, f, c; rd(u, v, f, c);
		add(u, v, f, c);
	}
	
	auto [f, c] = flow();
	printf("%d %d", f, c);
}