#include<bits/stdc++.h>
using namespace std;
namespace IO{
	template<typename T>inline bool read(T &x){
		x=0;
		char ch=getchar();
		bool flag=0,ret=0;
		while(ch<'0'||ch>'9') flag=flag||(ch=='-'),ch=getchar();
		while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar(),ret=1;
		x=flag?-x:x;
        return ret;
	}
	template<typename T,typename ...Args>inline bool read(T& a,Args& ...args){
	    return read(a)&&read(args...);
	}
	template<typename T>void prt(T x){
		if(x>9) prt(x/10);
		putchar(x%10+'0');
	}
	template<typename T>inline void put(T x){
		if(x<0) putchar('-'),x=-x;
		prt(x);
	}
	template<typename T>inline void put(char ch,T x){
		if(x<0) putchar('-'),x=-x;
		prt(x);
		putchar(ch);
	}
	template<typename T,typename ...Args>inline void put(T a,Args ...args){
	    put(a);
		put(args...);
	}
	template<typename T,typename ...Args>inline void put(const char ch,T a,Args ...args){
	    put(ch,a);
		put(ch,args...);
	}
	inline void put(string s){
		for(int i=0,sz=s.length();i<sz;i++) putchar(s[i]);
	}
	inline void put(const char* s){
		for(int i=0,sz=strlen(s);i<sz;i++) putchar(s[i]);
	}
}
using namespace IO;
#define N 405
#define M 100005
#define int long long
#define inf 0x3f3f3f3f3f3f3f3f
int n,m,s,t,head[N],cnt=1,now[N],vis[N],dis[N];
struct edge{
	int v,nxt,flow,cost;
}e[N<<1];
inline void adde(int u,int v,int flow,int cost){
	e[++cnt]=(edge){v,head[u],flow,cost},head[u]=cnt;
}
inline void add(int u,int v,int flow,int cost){
	adde(u,v,flow,cost),adde(v,u,0,-cost);
}
inline bool bfs(){
	memset(dis,0x3f,sizeof(dis));
	memset(vis,0,sizeof(vis));
	queue<int> q;
	q.push(t),now[t]=head[t],vis[t]=1,dis[t]=0;
	while(!q.empty()){
		int x=q.front();
		q.pop(),vis[x]=0;
		for(int i=head[x];i;i=e[i].nxt){
			int v=e[i].v;
			if(e[i^1].flow&&dis[v]>dis[x]+e[i^1].cost){
				dis[v]=dis[x]+e[i^1].cost;
				if(!vis[v]) q.push(v),vis[v]=1,now[v]=head[v];
			}
		}
	}
	return dis[s]!=inf;
}
inline int dfs(int x,int Max){
	if(x==t) return Max;
	int res=0,k;
	vis[x]=1;
	for(int i=now[x];i&&Max;i=e[i].nxt){
		now[x]=i;
		int v=e[i].v;
		if(!vis[v]&&dis[v]+e[i].cost==dis[x]&&e[i].flow){
			k=dfs(v,min(Max,e[i].flow));
			e[i].flow-=k,e[i^1].flow+=k;
			Max-=k,res+=k;
		}
	}
	return res;
}
signed main(){
	read(n,m),s=1,t=n;
	for(int i=1,u,v,w,c;i<=m;i++) read(u,v,w,c),add(u,v,w,c);
	int maxflow=0,mincost=0;
	while(bfs()){
		int res;
		memset(vis,0,sizeof(vis));
		while(res=dfs(s,inf)) maxflow+=res,mincost+=res*dis[s];
	}
	put(' ',maxflow,mincost);
	return 0;
}