/*
    长弓背负，仙女月鹫，
	梦中徐来，长夜悠悠。
	今宵共君，夜赏囃子，
	盼君速归，长夜悠悠。
	睡意袭我，眼阖梦徭，
	睡意袭我，意归襁褓。
	手扶卓揭，仙女水狃，
	盼君速归，长夜悠悠。
	今宵共君，戏于西楼，
	盼君速归，长夜悠悠。
	睡意袭我，涟锜池留，
	睡意袭我，意归海角。
					                  ——《ever17》
*/
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define int long long
inline int read()
{
	int sum = 0, nega = 1;
	char ch = getchar();
	while (ch > '9'||ch < '0')
	{
	    if (ch == '-') nega = -1;
		ch = getchar();
	}
	while (ch <= '9'&&ch >= '0') sum = sum * 10 + ch - '0', ch = getchar ();
	return sum * nega;
}
const int N = 5009, M = 50009, INF = 1e18;
struct Dinic
{
	int n, m, s, t, cnt = 1;
	int to[M << 1], nxt[M << 1], val[M << 1], head[N], cost[M << 1];
	int a[N], ans, dis[N], vis[N];
	inline void addedge(int u, int v, int w, int c)
	{
		to[++cnt] = v, nxt[cnt] = head[u], head[u] = cnt; cost[cnt] = c, val[cnt] = w;
		to[++cnt] = u, nxt[cnt] = head[v], head[v] = cnt; cost[cnt] = -c, val[cnt] = 0;
	}
	inline int spfa()
	{
		queue<int> q;
		for (int i = 1; i <= n; i++) dis[i] = INF, vis[i] = 0;
		dis[s] = 0, q.push(s); vis[s] = 1;
		while(!q.empty())
		{
			int u = q.front(); q.pop();
			vis[u] = 0;
			for (int i = head[u]; i; i = nxt[i])
				if(val[i] && dis[to[i]] > dis[u] + cost[i])
				{
					dis[to[i]] = dis[u] + cost[i];
					if(!vis[to[i]])
					{
						vis[to[i]] = 1; q.push(to[i]);
					}
				}
		}
		return dis[t] != INF;
	}
	int ret;
	inline int dfs(int u, int flow)
	{
		if(u == t) return flow;
		vis[u] = 1;
		int res = flow, tot = 0;
		for (int i = head[u]; i; i = nxt[i])
			if(!vis[to[i]] && val[i] && dis[to[i]] == dis[u] + cost[i])
			{
				int pp = dfs(to[i], min(res, val[i]));
				res -= pp, val[i] -= pp, val[(i ^ 1)] += pp, tot += pp;
				ret += pp * cost[i];
			}
		vis[u] = 0;
		return tot;
	}
	inline void dinic()
	{
		while(spfa()) 
		{
			for (int i = 1; i <= n; i++) vis[i] = 0;
			ans += dfs(s, INF);
		}
		cout << ans << " " << ret << endl;
	}
}D;
signed main()
{
	D.n = read(), D.m = read(), D.s = read(), D.t = read();
	for (int i = 1; i <= D.m; i++)
	{
		int u = read(), v = read(), w = read(), c = read();
		D.addedge(u, v, w, c);
	}
	D.dinic();
	return 0;
}