#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int >
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
using namespace std;
const int N = 1e6 + 7;
const ll inf = 1e18;

int n, m, s, t;
int ehd[N], ev[N], enx[N], eid = 1;
ll ew[N], ec[N];
void eadd(int u, int v, ll w, ll c) {
	++eid, ev[eid] = v, ew[eid] = w, ec[eid] = c, enx[eid] = ehd[u], ehd[u] = eid;
}
void add(int u, int v, ll w, ll c) {
	eadd(u, v, w, c);
	eadd(v, u, 0, -c);
} 

ll dis[N];
bool vis[N];
int lst[N];
bool spfa() {
	L(i, 1, n) dis[i] = inf, vis[i] = false;
	queue < int > q;
	q.push(s), dis[s] = 0;
	while(!q.empty()) {
		int u = q.front();
		q.pop(), vis[u] = false;
		for(int i = ehd[u]; i; i = enx[i]) 
			if(dis[ev[i]] > dis[u] + ec[i] && ew[i]) {
				dis[ev[i]] = dis[u] + ec[i], lst[ev[i]] = i;
				if(!vis[ev[i]]) q.push(ev[i]), vis[ev[i]] = true;
			}
	} 
	return dis[t] < inf;
}
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0); 
	cin >> n >> m;
	s = 1, t = n;
	L(i, 1, m) {
		int u, v, w, c;
		cin >> u >> v >> w >> c;
		add(u, v, w, c);
	}
	ll mf = 0, mc = 0;
	while(spfa()) {
		ll mn = inf;
		for(int x = t; x != s; x = ev[lst[x] ^ 1]) mn = min(mn, ew[lst[x]]);
		for(int x = t; x != s; x = ev[lst[x] ^ 1]) ew[lst[x]] -= mn, ew[lst[x] ^ 1] += mn;
		mf += mn, mc += mn * dis[t];
	}
	cout << mf << ' ' << mc << '\n';
	return 0;
}