#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll inf_ll=numeric_limits<ll>::max();
constexpr int max_n=400;
constexpr int max_m=15000;
constexpr int lim=1000000;
struct note{
	int u,v,c,w;
}edgs[max_m+1];
int deg[max_n+1],ed[max_n+1];
struct edge_t{
	int v,iv,f,c;
}buf[max_m*2];
int que[lim+1];
ll dist[max_n+1];
int mnf[max_n+1],prv[max_n+1];
bool vis[max_n+1];
bool spfa(const int n,const int s,const int t){
	for(int i=1; i<=n; ++i)
		dist[i]=inf_ll,vis[i]=0,mnf[i]=0;
	que[0]=s,dist[s]=0,vis[s]=1,mnf[s]=numeric_limits<int>::max();
	for(int head=0,tail=0; head<=tail; ++head){
		const int u=que[head];
		const int fu=mnf[u];
		const ll du=dist[u];
		// fprintf(stderr,"%d: %lld\n",u,du);
		vis[u]=0;
		for(edge_t*it=buf+deg[u],*const ed=buf+::ed[u]; it!=ed; ++it)
			if(it->f){
				const ll dv=du+it->c;
				if(dv<dist[it->v]){
					dist[it->v]=dv,mnf[it->v]=min(fu,it->f),prv[it->v]=it->iv;
					if(!vis[it->v])
						que[++tail]=it->v,vis[it->v]=1;
				}
			}
	}
	return dist[t]<inf_ll;
}
int main(){
	int n,m,s,t;
	scanf("%d%d",&n,&m);
	s=1,t=n;
	for(int i=1; i<=m; ++i){
		scanf("%d%d%d%d",&edgs[i].u,&edgs[i].v,&edgs[i].c,&edgs[i].w);
		++deg[edgs[i].u],++deg[edgs[i].v];
	}
	for(int i=2; i<=n; ++i)
		deg[i]+=deg[i-1];
	ed[0]=0;
	for(int i=1; i<=n; ++i)
		ed[i]=deg[i];
	for(int i=m; i; --i){
		const int u=edgs[i].u,v=edgs[i].v;
		const int edu=--deg[u];
		const int edv=--deg[v];
		buf[edu].v=v,buf[edu].iv=edv,buf[edu].f=edgs[i].c,buf[edu].c=edgs[i].w;
		buf[edv].v=u,buf[edv].iv=edu,buf[edv].f=0,buf[edv].c=-edgs[i].w;
	}
	ll ans=0,cst=0;
	while(spfa(n,s,t)){
		const int tmp=mnf[t];
		ans+=tmp;
		// fprintf(stderr,"* %d %lld\n",tmp,dist[t]);
		cst+=dist[t]*tmp;
		for(int u=t; u!=s; ){
			const int id=prv[u];
			buf[id].f+=tmp,buf[buf[id].iv].f-=tmp;
			u=buf[id].v;
		}
	}
	printf("%lld %lld\n",ans,cst);
	return 0;
}