// Problem: P3381 【模板】最小费用最大流
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P3381
// Memory Limit: 128 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define all(s) s.begin(), s.end()
using namespace std;
using ll = long long;
using ull = unsigned long long;

const int _N = 5e3 + 5;
const int _M = 5e4 + 5;

int T;

namespace flows {
	struct Edge {
		int to, nxt;
		ll cap, w;
	} e[_M << 1];
	int cnt = 1, head[_N];
	void add_edge(int u, int v, ll c, ll w) {
		e[++cnt].nxt = head[u];
		e[cnt].to = v;
		e[cnt].cap = c;
		e[cnt].w = w;
		head[u] = cnt;
	}
	void add(int u, int v, ll c, ll w) {
		add_edge(u, v, c, w);
		add_edge(v, u, 0, -w);
	}
	ll dis[_N], inc[_N], pre[_N];
	int vis[_N];
	bool spfa(int s, int t) {
		memset(dis, 0x3f, sizeof(dis));
		queue<int> q;
		q.push(s); dis[s] = 0; inc[s] = LLONG_MAX / 2; inc[t] = 0;
		while (!q.empty()) {
			int u = q.front(); q.pop();
			vis[u] = 0;
			for (int i = head[u]; i; i = e[i].nxt) {
				int v = e[i].to; ll w = e[i].w;
				if (e[i].cap && dis[v] > dis[u] + w) {
					dis[v] = dis[u] + w;
					inc[v] = min(e[i].cap, inc[u]); pre[v] = i;
					if (!vis[v]) {
						vis[v] = 1;
						q.push(v);
					}
				}
			}
		}
		return inc[t];
	}
	pair<ll, ll> mincost(int s, int t) {
		ll mf = 0, mc = 0;
		while (spfa(s, t)) {
			mf += inc[t];
			for (int u = t; u != s; u = e[pre[u] ^ 1].to) {
				e[pre[u]].cap -= inc[t];
				e[pre[u] ^ 1].cap += inc[t];
				mc += inc[t] * e[pre[u]].w;
			}
		}
		return {mf, mc};
	}
};

void solve() {
	int n, m; cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int u, v; ll c, w; cin >> u >> v >> c >> w;
		flows::add(u, v, c, w);
	}
	auto res = flows::mincost(1, n);
	cout << res.first << ' ' << res.second << '\n';
	return;
}

int main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	// cin >> T;
	T = 1;
	while (T--) {
		solve();
	}
}