#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 1e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define goo(u) for(ll i=headd[u];i;i=e[i].nxt)
ll n,m,head[440],headd[440],cnt=1;
ll s,t,dis[440],ansf=0,ansc=0;
bl ck[440];
struct node{
	ll nxt,to,w,c;
}e[30030];
void add(ll u,ll v,ll ww,ll cc){
	e[++cnt].nxt=head[u];
	e[cnt].to=v;
	e[cnt].w=ww;
	e[cnt].c=cc;
	head[u]=cnt;
}
il bl spfa(){
	fr(i,1,n) headd[i]=head[i];
	fr(i,1,n) dis[i]=inf;
	dis[s]=1;
	queue<ll> q;
	q.push(s);
	ck[s]=1;
	while(!q.empty()){
		ll u=q.front();
		q.pop();
		ck[u]=0;
		go(u){
			ll v=e[i].to;
			if(e[i].w>0&&dis[v]>(dis[u]+e[i].c)){
				dis[v]=dis[u]+e[i].c;
				if(!ck[v]) q.push(v);
				ck[v]=1;
			}
		}
	}
	return dis[t]!=inf;
}
ll dfs(ll u,ll sum){
	if(u==t) return sum;
	ll res=0;
	ck[u]=1;
	goo(u){
		ll v=e[i].to;
		if(!sum) break;
		if(!ck[v]&&e[i].w>0&&dis[v]==(dis[u]+e[i].c)){
			ll tmp=dfs(v,min(e[i].w,sum));
			ansc+=tmp*e[i].c;
			e[i].w-=tmp;
			e[i^1].w+=tmp;
			sum-=tmp;
			res+=tmp;
		}
		headd[u]=i;
	}
	ck[u]=0;
	return res;
}
int main(){
	n=read();
	m=read();
	fr(i,1,m){
		ll u=read(),v=read(),w=read(),c=read();
		add(u,v,w,c);
		add(v,u,0,-c);
	}
	s=1;
	t=n;
	while(spfa()) ansf+=dfs(s,inf);
	pf("%lld %lld",ansf,ansc);
}