#include<bits/stdc++.h>
using namespace std;
  #define int long long
#define F(i, l, r) for(int i = (l); i <= (r); ++i)
#define dF(i, r, l) for(int i = (r); i >= (l); --i)

int ri() {
	int x = 0, f = 1;
	char c = getchar();
	while(c < '0' || c > '9') {
		if(c == '-') f = -1;
		c = getchar();
	}
	while(c >= '0' && c <= '9') {
		x = x* 10 + c - 48;
		c  = getchar();
	} return x * f;
}

const int _ = 2e5 + 5;

int n, m;

struct MCMF {
	int s, t, tot = 1, head[_], to[_ << 1], nxt[_ << 1], cur[_], fl[_ << 1], w[_ << 1];
	int dis[_];
	void add(int u, int v, int c1, int c2) {
		to[++tot] = v, nxt[tot] = head[u], head[u] = tot, fl[tot] = c1, w[tot] = c2;
	}
	void Add(int u, int v, int w, int c) {
		add(u, v, w, c), add(v, u, 0, -c);
	}
	bool vis[_];
	bool bfs() {
		F(i, 0, n + 2) dis[i] = 0x3f3f3f3f3f3f3f3f, vis[i] = 0;
		dis[s] = 0, vis[s] = 1;;
		queue<int > q;
		q.push(s);
		memcpy(cur, head, sizeof (cur));
		while(!q.empty()) {
			int u = q.front();
			q.pop(); vis[u] = 0;
			for(int i = head[u], v = to[i]; i; i = nxt[i], v = to[i]) {
				if(fl[i] > 0 && dis[v] > dis[u] + w[i]) {
					dis[v] = dis[u] + w[i];
					if(!vis[v]) q.push(v), vis[v] = 1;
				}
			}
		}
		return dis[t] != 0x3f3f3f3f3f3f3f3f;
	}
	bool lv[_];
	int dfs(int u, int flow = 0x3f3f3f3f3f3f3f3f) {
		if(u == t) return flow;
		int rmn = flow;
		lv[u] = 1;
		for(int &i = cur[u], v = to[i]; i && rmn; i = nxt[i], v = to[i]) {
			if(fl[i] > 0 && !lv[v] &&dis[v] == dis[u] + w[i]) {
				int c = dfs(v, min(rmn, fl[i]));
				fl[i] -= c, fl[i ^ 1] += c;
				rmn -= c;
			}
		}
		lv[u] = 0;
		return flow - rmn;
	}
	void dinic() {
		int res = 0, W = 0;
		while(bfs()) {
			int w = dfs(s);
			res += w;
			W += dis[t] * w;
		}
		cout << res << ' ' << W <<'\n';
	}
} S;

signed main() {
	n = ri(), m = ri();
	S.s = 1, S.t = n;
	F(i, 1, m) {
		int u = ri(), v = ri(), w = ri(), c = ri();
		S.Add(u, v, w, c);
	} 
	S.dinic();
}