#include<bits/stdc++.h>
using namespace std;
template<typename T>inline void read(T &x){
	x=0;
	bool flag=0;
	char ch=getchar();
	while(ch<'0'||ch>'9') flag=flag||(ch=='-'),ch=getchar();
	while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
	x=flag?-x:x;
}
template<typename T,typename ...Args>inline void read(T &x,Args &...args){
	read(x),read(args...);
}
template<typename T>inline 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){
	put(x),putchar(ch);
}
template<typename T,typename ...Args>inline void put(char ch,T x,Args ...args){
	put(ch,x),put(ch,args...);
}
#define ll long long
#define N 405
#define M 30005
const int inf=2147483647;
int n,m;
struct Flow{
	struct edge{
		int v,nxt,flow;
		ll cost;
	}e[M<<1];
	int head[N],cnt,s,t;
	ll maxflow,mincost;
	struct node{
		int x;ll v;
		node(int _x=0,ll _v=0):x(_x),v(_v){}
		inline bool operator<(const node &b)const{
			return v>b.v;
		}
	};
	Flow(){
		memset(e,0,sizeof(e));
		memset(head,0,sizeof(head));
		cnt=1,s=t=0;
	}
	inline void adde(int u,int v,int flow,ll cost){
		e[++cnt]=(edge){v,head[u],flow,cost},head[u]=cnt;
	}
	inline void add(int u,int v,int flow,ll cost){
		adde(u,v,flow,cost),adde(v,u,0,-cost);
	}
	bool vis[N];
	ll dis[N];
	__int128 h[N];
	int now[N];
	inline void spfa(){
		memset(h,0x3f,sizeof(h));
		memset(vis,0,sizeof(vis));
		queue<int> q;
		q.push(s),vis[s]=1,h[s]=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(h[v]>h[x]+e[i].cost&&e[i].flow){
					h[v]=h[x]+e[i].cost;
					if(!vis[v]) q.push(v),vis[v]=1;
				}
			}
		}
	}
	inline bool dijkstra(){
		memset(dis,0x3f,sizeof(dis));
		memset(vis,0,sizeof(vis));
		priority_queue<node> q;
		q.push(node(s,0)),dis[s]=0,now[s]=head[s];
		while(!q.empty()){
			int x=q.top().x;q.pop();
			if(vis[x]) continue;
			vis[x]=1;
			for(int i=head[x];i;i=e[i].nxt){
				int v=e[i].v;__int128 w=e[i].cost-h[v]+h[x];
				if(e[i].flow&&dis[v]>dis[x]+w)
					now[v]=head[v],dis[v]=dis[x]+w,q.push(node(v,dis[v]));
			}
		}
		return dis[t]<=inf;
	}
	inline int dfs(int x,int Max){
		if(x==t) return Max;
		vis[x]=1;
		int res=0;
		for(int i=now[x];i&&Max;i=e[i].nxt){
			int v=e[i].v;now[x]=i;__int128 w=e[i].cost-h[v]+h[x];
			if(!vis[v]&&e[i].flow&&dis[v]==dis[x]+w){
				int k=dfs(v,min(Max,e[i].flow));
				res+=k,Max-=k,e[i^1].flow+=k,e[i].flow-=k;
			}
		}
		vis[x]=0;
		return res;
	}
	inline void mcmf(){
		spfa();
		while(dijkstra()){
			memset(vis,0,sizeof(vis));
			int res=dfs(s,inf);
			for(int i=1;i<=n;i++) h[i]+=dis[i];
			maxflow+=res,mincost+=h[t]*res;
		}
	}
}F;
int main(){
	read(n,m),F.s=1,F.t=n;
	for(int i=1,u,v,flow,cost;i<=m;i++)
		read(u,v,flow,cost),F.add(u,v,flow,cost);
	F.mcmf();
	put(' ',F.maxflow,F.mincost);
	return 0;	
}