#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
namespace graph{
const int MAXN=3e4+5;
const ll inf=1e18;
struct edge{
	ll v,w,c,la;
}e[MAXN];int tot=1;
int las[MAXN],cur[MAXN];
ll dis[MAXN];bool inq[MAXN],vis[MAXN];
int n,s,t;
void add(int u,int v,int w,int c){
	++tot;
	e[tot].v=v,e[tot].w=w,e[tot].c=c;
	e[tot].la=las[u],las[u]=tot;
}
void Add(int u,int v,int w,int c){
	add(u,v,w,c);add(v,u,0,-c);
}
bool SPFA(){
	for(int i=1;i<=n;i++)
		dis[i]=inf,inq[i]=0;
	dis[s]=0;
	queue<int> q;q.push(s);
	while(!q.empty()){
		int u=q.front();inq[u]=0;q.pop();
		for(int i=las[u];i;i=e[i].la){
			int v=e[i].v,w=e[i].w,c=e[i].c;
			if(w&&dis[v]>dis[u]+c){
				dis[v]=dis[u]+c;
				if(!inq[v]){
					inq[v]=1;
					q.push(v);
				}
			}
		}
	}
	return dis[t]!=inf;
}
ll dinic(int u,ll flow){
	if(u==t) return flow;
	vis[u]=1;
	ll rmn=flow;
	for(int i=cur[u];rmn&&i;i=e[i].la){
		ll v=e[i].v,w=e[i].w,c=e[i].c;
		if(w&&dis[v]==dis[u]+c&&!vis[v]){
			ll fl=dinic(v,min(rmn,w));
			rmn-=fl,e[i].w-=fl,e[i^1].w+=fl;
		}
	}
	vis[u]=0;
	return flow-rmn;
}
pair<ll,ll> MCMF(){
	ll flow=0,cost=0;
	while(SPFA()){
		for(int i=1;i<=n;i++)
			cur[i]=las[i],vis[i]=0;
		ll fl=dinic(s,inf);
		flow+=fl,cost+=fl*dis[t];
	}
	return MP(flow,cost);
}
}
int main(){
	int m;
	cin>>graph::n>>m;
	graph::s=1,graph::t=graph::n;
	for(int i=1;i<=m;i++){
		ll u,v,w,c;cin>>u>>v>>w>>c;
		graph::Add(u,v,w,c);
	}
	auto ans=graph::MCMF();
	cout<<ans.first<<" "<<ans.second;
	return 0;
}