#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#define int long long
using namespace std;

int n,m,cnt=1,cost;
int h[405];
int cur[405];
int dis[405];
bool mp[405];
bool vis[405];
struct node{int v,nxt,c,w;}edge[30005];

inline void addedge(int u,int v,int c,int w){
	edge[++cnt]={v,h[u],c,w};
	h[u]=cnt;
	edge[++cnt]={u,h[v],0,-w};
	h[v]=cnt;
	return ;
}

inline bool bfs(int S,int T){
	for(int i=1;i<=n;i++) dis[i]=1e18,vis[i]=0;
	dis[S]=0;
	queue <int> q;
	q.push(S);
	vis[S]=1;
	while(!q.empty()){
		int u=q.front();
		q.pop();
		vis[u]=0;
		for(int i=h[u];i;i=edge[i].nxt){
			int v=edge[i].v;
			if(edge[i].c&&dis[v]>dis[u]+edge[i].w){
				dis[v]=dis[u]+edge[i].w;
				if(!vis[v]) vis[v]=1,q.push(v);
			}
		}
	}
	return (dis[T]!=1e18);
}

inline int dfs(int u,int T,int flow){
	if(u==T||!flow) return flow;
	int res=0;
	mp[u]=1;
	for(int i=cur[u];i;i=edge[i].nxt){
		cur[u]=i;
		int v=edge[i].v;
		if(mp[v]||!edge[i].c||dis[v]!=dis[u]+edge[i].w) continue;
		int d=dfs(v,T,min(flow,edge[i].c));
		res+=d;
		edge[i].c-=d;
		edge[i^1].c+=d;
		flow-=d;
		cost+=d*edge[i].w;
	}
	mp[u]=0;
	return res;
}

inline int Dinic(int S,int T){
	int f=0;
	while(bfs(S,T)){
		for(int i=1;i<=n;i++) cur[i]=h[i];
		f+=dfs(S,T,1e18);
	}
	return f;
}

signed main(){
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=m;i++){
		int u,v,c,w;
		scanf("%lld%lld%lld%lld",&u,&v,&c,&w);
		addedge(u,v,c,w);
	}
	int flow=Dinic(1,n);
	printf("%lld %lld\n",flow,cost);

	return 0;
}