#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
struct Min_Cost_Flow{
	static constexpr ll Inf=numeric_limits<ll>::max();
	const int n;
	struct Edge{
		int v;
		ll w,c;
	};
	vector<Edge> e;
	vector<vector<int>> g;
	vector<int> now;
	vector<ll> dis;
	vector<bool> inq;
	Min_Cost_Flow(int _n):n(_n),g(n+1){}
	bool spfa(int s,int t){
		dis.assign(n+1,Inf);
		inq.assign(n+1,0);
		vector<int> q;
		dis[s]=0,inq[s]=1;
		q.push_back(s);
		For(i,0,int(q.size())-1){
			int u=q[i];
			inq[u]=0;
			for(int j:g[u]){
				auto [v,w,c]=e[j];
				if(w&&dis[u]+c<dis[v]){
					dis[v]=dis[u]+c;
					if(!inq[v]) inq[v]=1,q.push_back(v);
				}
			}
		}
		return dis[t]!=Inf;
	}
	ll dinic(int u,int t,ll flow,ll& cost){
		if(u==t) return flow;
		ll rest=flow;
		inq[u]=1;
		for(int i=now[u];i<int(g[u].size())&&rest;++i){
			now[u]=i;
			int j=g[u][i];
			auto [v,w,c]=e[j];
			if(w&&!inq[v]&&dis[v]==dis[u]+c){
				ll k=dinic(v,t,min(rest,w),cost);
				if(!k) dis[v]=0;
				e[j].w-=k,e[j^1].w+=k,rest-=k;
				cost+=k*c;
			}
		}
		if(!rest) inq[u]=0;
		return flow-rest;
	}
	void add_edge(int u,int v,ll w,ll c){
		g[u].push_back(e.size());
		e.push_back({v,w,c});
		g[v].push_back(e.size());
		e.push_back({u,0,-c});
	}
	pair<ll,ll> flow(int s,int t){
		ll ans1=0,ans2=0;
		while(spfa(s,t)){
			now.assign(n+1,0);
			inq.assign(n+1,0);
			ll flow;
			while((flow=dinic(s,t,Inf,ans2))) ans1+=flow;
		}
		return {ans1,ans2};
	}
};
const int N=1205;
int n,m,s,t;
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>m;
	s=1,t=n;
	Min_Cost_Flow f(n);
	For(i,1,m){
		int u,v,w,c;
		cin>>u>>v>>w>>c;
		f.add_edge(u,v,w,c);
	}
	auto [ans1,ans2]=f.flow(s,t);
	cout<<ans1<<' '<<ans2<<'\n';
	return 0;
}