// Author: kyEEcccccc

#include <bits/stdc++.h>

using namespace std;

using LL = long long;
using ULL = unsigned long long;

#define F(i, l, r) for (int i = (l); i <= (r); ++i)
#define FF(i, r, l) for (int i = (r); i >= (l); --i)
#define MAX(a, b) ((a) = max(a, b))
#define MIN(a, b) ((a) = min(a, b))
#define SZ(a) ((int)((a).size()) - 1)

namespace Dinic_C
{
	using CAPT = LL; using COSTT = LL;
	const int V = 405, E = 15005;

	int n;
	struct Edge
	{
		int v;
		CAPT cap, fl;
		COSTT co;
	} e[E << 1];
	int nxt[E << 1], hd[V], tot_e;

	void clr(int nn)
	{
		n = nn;
		memset(hd + 1, -1, n * sizeof (int));
		tot_e = 0;
	}

	int ins_e(int u, int v, CAPT cap, COSTT co)
	{
		e[tot_e] = {v, cap, 0, co};
		nxt[tot_e] = hd[u];
		hd[u] = tot_e++;
		e[tot_e] = {u, 0, 0, -co};
		nxt[tot_e] = hd[v];
		hd[v] = tot_e++;
		return tot_e - 2;
	}

	COSTT lv[V];
	int from[V];
	bool vis[V], inq[V];

	bool spfa(int s, int t)
	{
		memset(vis + 1, 0, n * sizeof (bool));
		vector<int> que; int hd_q = 0;
		lv[t] = 0;
		vis[t] = 1;
		inq[t] = 1;
		que.push_back(t);
		while (hd_q < que.size())
		{
			int u = que[hd_q++];
			inq[u] = 0;
			for (int i = hd[u]; i != -1; i = nxt[i])
			{
				if (e[i ^ 1].fl == e[i ^ 1].cap) continue;
				if (vis[e[i].v] && lv[e[i].v] <= lv[u] + e[i ^ 1].co) continue;
				vis[e[i].v] = 1;
				lv[e[i].v] = lv[u] + e[i ^ 1].co;
				from[e[i].v] = i ^ 1;
				if (!inq[e[i].v]) que.push_back(e[i].v), inq[e[i].v] = 1;
			}
		}
		return vis[s];
	}

	pair<CAPT, COSTT> dinic(int s, int t)
	{
		pair<CAPT, COSTT> ans = {0, 0};
		while (spfa(s, t))
		{
			COSTT sc = 0;
			CAPT mn = numeric_limits<CAPT>::max();
			int p = s;
			while (p != t)
			{
				MIN(mn, e[from[p]].cap - e[from[p]].fl);
				sc += e[from[p]].co;
				p = e[from[p]].v;
			}
			ans.first += mn;
			ans.second += mn * sc;
			p = s;
			while (p != t)
			{
				e[from[p]].fl += mn;
				e[from[p] ^ 1].fl -= mn;
				p = e[from[p]].v;
			}
		}
		return ans;
	}
}

int n, m;

signed main(void)
{
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0), cin.tie(nullptr);

	cin >> n >> m;
	Dinic_C::clr(n);
	F(i, 1, m)
	{
		int u, v, c, w; cin >> u >> v >> c >> w;
		Dinic_C::ins_e(u, v, c, w);
	}
	auto ans = Dinic_C::dinic(1, n);
	cout << ans.first << ' ' << ans.second << '\n';

	return 0;
}