#include <bits/stdc++.h>
#define rfor(i,l,r) for(int i=l;i<=r;i++)
#define irfor(i,r,l) for(int i=r;i>=l;i--)
#define y0 hfgdsgxdhrarsgtiddfndksgrsgilhfs
#define y1 qwertyuioplkjhgfdsazxcvbnmafdzds
#define ls(p) p<<1
#define rs(p) p<<1|1
#define mkp make_pair
using namespace std;typedef long long ll;typedef long double ld;typedef unsigned long long ull;typedef pair<int,int> pii;
inline ll read(){ll x=0,f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}return x*f;}
inline ll qpow(ll a,ll b,ll p){ll ans=1;while(b){if(b&1)ans=ans*a%p;a=a*a%p;b>>=1;}return ans;}
inline void gmin(int &a,int b){if(b<a)a=b;}inline void gmin(ll &a,ll b){if(b<a)a=b;}
inline void gmax(int &a,int b){if(b>a)a=b;}inline void gmax(ll &a,ll b){if(b>a)a=b;}
inline int max(int a,int b){return a>b?a:b;}inline int min(int a,int b){return a<b?a:b;}
inline ll max(ll a,ll b){return a>b?a:b;}inline ll min(ll a,ll b){return a<b?a:b;}
const int N = 5e3+5,M = 5e4+5,mod=1e9+7;
int n,m,s,t;
struct edge{int to,nxt;ll dis,cst;edge(int to=0,int nxt=0,ll dis=0,ll cst=0):to(to),nxt(nxt),dis(dis),cst(cst){}}e[M*2];int head[N],cnt=1;
void adde(int u,int v,int w,int c){e[++cnt]=edge(v,head[u],w,c);head[u]=cnt;}
int now[N];ll d[N];
bool inq[N];
queue<int> q;
bool spfa()
{
	memset(d,0x3f,sizeof(d));
	memcpy(now,head,sizeof(head));
	while(!q.empty()) q.pop();
	q.push(s);d[s] = 0;inq[s] = 1;
	while(!q.empty())
	{
		int u = q.front();q.pop();inq[u] = 0;
		for(int i = head[u];i;i = e[i].nxt)
		{
			int v = e[i].to;ll w = e[i].dis,c = e[i].cst;
			if(w && d[v] > d[u]+c)
			{
				d[v] = d[u]+c;
				if(!inq[v]) q.push(v),inq[v] = 1;
			}
		}
	}
	return d[t]<1e10;
}
ll cstsum;
ll dinic(int u,ll flow)
{
	if(u == t) return flow;
	ll rest = flow,i;
	inq[u] = 1;
	for(i = now[u];i;i = e[i].nxt)
	{
		int v = e[i].to;
		ll w = e[i].dis,c = e[i].cst;
		if(w && !inq[v] && d[v] == d[u]+c)
		{
			ll fl = dinic(v,min(w,rest));
			if(!fl) d[v] = 1e10;
			cstsum += c*fl;
			e[i].dis -= fl;e[i^1].dis += fl;
			rest -= fl;
		}
		if(!rest) break;
	}
	now[u] = i;
	inq[u] = 0;
	return flow - rest;
}
inline void solve()
{
	cin >> n >> m;
	s = 1;t = n;
	//cin >> s >> t;
	rfor(i,1,m)
	{
		int u,v,c,w;
		cin >> u >> v >> w >> c;
		adde(u,v,w,c);
		adde(v,u,0,-c);
	}
	ll flow = 0,ans = 0;
	while(spfa())
	{
		do
		{
			flow = dinic(s,1e18);
			ans += flow;
		}while(flow);
	}
	cout << ans << ' ' << cstsum;
}
int main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t = 1;//cin >> t;
	while(t--) solve();
	return 0;
}