#include<bits/stdc++.h>
#define ll long long 
#define low(X) (X&(-X))
#define mk(A,B) make_pair(A,B)
using namespace std;
ll read(){
	ll S=0,F=1;
	char ch=getchar();
	while(!isdigit(ch)){
		if(ch=='-')F*=-1;
		ch=getchar();
	}while(isdigit(ch)){
		S=(S<<3)+(S<<1)+(ch^48);
		ch=getchar();
	}return S*F;;
}const ll N=400,M=15000,inf=(1ll<<31);
struct ED{
	ll to,nxt,f,c;
}ed[M*2+10];
ll head[N+10],cnt=1;
void add(ll U,ll V,ll F,ll C){
	ed[++cnt].to=V;
	ed[cnt].nxt=head[U];
	ed[cnt].f=F;
	ed[cnt].c=C;
	head[U]=cnt;
	ed[++cnt].to=U;
	ed[cnt].nxt=head[V];
	ed[cnt].f=0;
	ed[cnt].c=-C;
	head[V]=cnt;
}ll n,m,S,T;
ll las[N+10],fl[N+10],dis[N+10];
bool vis[N+10];
bool sp(){
	memset(dis,0x3f,sizeof(dis));
	memset(fl,0,sizeof(fl));
	queue<ll >que;que.push(S);
	fl[S]=inf;dis[S]=0;vis[S]=true;
	while(!que.empty()){
		ll x=que.front();que.pop();vis[x]=false;
		for(ll i=head[x];i;i=ed[i].nxt){
			if(ed[i].f<1)continue;
			if(dis[x]+ed[i].c<dis[ed[i].to]){
				dis[ed[i].to]=dis[x]+ed[i].c;
				las[ed[i].to]=i;fl[ed[i].to]=min(fl[x],ed[i].f);
				if(!vis[ed[i].to]){
					que.push(ed[i].to);
					vis[ed[i].to]=true;
				}
			}
		}
	}return fl[T]>0;
}int main(){
	S=1;T=n=read();m=read();
	for(ll i=1;i<=m;i++){
		ll u,v,f,c;
		u=read();v=read();f=read();c=read();
		add(u,v,f,c);
	}ll flo=0,cs=0;while(sp()){
		flo+=fl[T];cs+=dis[T]*fl[T];
		ll x=T;while(x!=S){
			ed[las[x]].f-=fl[T];
			ed[las[x]^1].f+=fl[T];
			x=ed[las[x]^1].to;
		}
	}printf("%lld %lld\n",flo,cs);
	return 0;
}