#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned long long;
const int N=4e2+10,M=1.5e4+10;
const ll INF=1e18;
int n,m,s,t;
struct edges{
	int to,c,w,nex;
}e[M*2];
int kk=1,head[N],pre[N];
ll d[N];
void add(int u,int v,int c,int w){
	e[++kk]={v,c,w,head[u]},head[u]=kk;
	e[++kk]={u,0,-w,head[v]},head[v]=kk;
}
bool spfa(){
	queue<int>q;
	fill(d+1,d+1+n,INF),d[s]=0,q.push(s);
	for(int u;!q.empty();){
		u=q.front(),q.pop();
		for(int i=head[u];i;i=e[i].nex){
			int v=e[i].to,w=e[i].w;
			if(e[i].c&&d[v]>d[u]+w){
				d[v]=d[u]+w,pre[v]=i,q.push(v);
			}
		}
	}
	return d[t]<INF;
}
pair<ll,ll> EK(){
	ll flow=0,cost=0;
	for(;spfa();){
		int mn=INT_MAX;
		for(int u=t;u^s;u=e[pre[u]^1].to){
			mn=min(mn,e[pre[u]].c);
		}
		for(int u=t;u^s;u=e[pre[u]^1].to){
			cost+=1ll*e[pre[u]].w*mn;
			e[pre[u]].c-=mn,e[pre[u]^1].c+=mn;
		}
		flow+=mn;
	}
	return {flow,cost};
}
int main(){
	scanf("%d%d",&n,&m),s=1,t=n;
	for(int u,v,c,w;m--;){
		scanf("%d%d%d%d",&u,&v,&c,&w);
		add(u,v,c,w);
	}
	auto [ans,res]=EK();
	cout<<ans<<' '<<res<<endl;
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif