// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <queue>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
namespace Dinic
{
	uint n;
	uint To[30005],Last[30005],tp;ullt Flow[30005];llt W[30005];
	uint End[405],Cur[405];llt Dep[405];bol Gone[405];
	voi bzr(uint n){Dinic::n=n,tp=0;for(uint i=0;i<n;i++)End[i]=-1;}
	voi insert(uint u,uint v,ullt f,llt w){
		To[tp]=v,Last[tp]=End[u],Flow[tp]=f,W[tp]=w,End[u]=tp++;
		To[tp]=u,Last[tp]=End[v],Flow[tp]=0,W[tp]=-w,End[v]=tp++;
	}
	bol bfs(uint p,uint t){
		for(uint i=0;i<n;i++)Cur[i]=End[i],Dep[i]=1e18,Gone[i]=0;
		std::queue<uint>Q;Q.push(p),Dep[p]=0,Gone[p]=1;
		while(Q.size()){
			p=Q.front(),Q.pop(),Gone[p]=0;
			for(uint e=End[p];~e;e=Last[e])
				if(Flow[e]&&_min(Dep[To[e]],Dep[p]+W[e])&&!Gone[To[e]])
					Q.push(To[e]),Gone[To[e]]=1;
		}
		return Dep[t]<1e17;
	}
	ullt dfs(uint p,uint t,ullt f){
		if(p==t)return f;
		if(Gone[p])return 0;
		Gone[p]=1;
		ullt ans=0;
		for(uint&e=Cur[p];~e;e=Last[e])if(Flow[e]&&Dep[To[e]]==Dep[p]+W[e]){
			ullt g=dfs(To[e],t,std::min(f,Flow[e]));
			Flow[e]-=g,f-=g,Flow[e^1]+=g,ans+=g;
			if(!f)return Gone[p]=0,ans;
		}
		Gone[p]=0;
		return ans;
	}
	std::pair<ullt,llt>run(uint s,uint t){
		ullt ans=0,user;llt w=0;
		while(bfs(s,t))
			ans+=user=dfs(s,t,-1),w+=(llt)user*Dep[t];
		return{ans,w};
	}
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
	uint n,m;scanf("%u%u",&n,&m);
	Dinic::bzr(n);
	while(m--){
		uint u,v,w,c;scanf("%u%u%u%u",&u,&v,&w,&c);
		Dinic::insert(u-1,v-1,w,c);
	}
	auto t=Dinic::run(0,n-1);
	printf("%llu %lld\n",t.first,t.second);
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。