# include <bits/stdc++.h>
using namespace std;
int dis[410],h[410],cur[410],head[410],nxt[30010],tot=1;
bool vis[410];
struct Edge
{
	int v,w,c,f;
	Edge(){}
	Edge(int v,int w,int c):v(v),w(w),c(c),f(0){}
}edge[30010];
struct Node
{
	int v,w;
	Node(int v,int w):v(v),w(w){}
	bool operator<(const Node &t)const{return w>t.w;}
};
void addedge(int u,int v,int w,int c)
{
	nxt[++tot]=head[u];
	edge[tot]=Edge(v,w,c);
	head[u]=tot;
}
void addE(int u,int v,int w,int c){addedge(u,v,w,c);addedge(v,u,-w,0);}
bool Dijk(int n,int s,int t)
{
	static priority_queue<Node> que;
	memset(vis+1,0,sizeof(bool)*n);
	memset(dis+1,-1,sizeof(int)*n);
	que.emplace(s,dis[s]=0);
	while(!que.empty())
	{
		int u=que.top().v;que.pop();
		if(vis[u]) continue;
		vis[u]=1;
		for(int i=head[u];i;i=nxt[i])
		{
			int v=edge[i].v,w=edge[i].w+h[u]-h[v],c=edge[i].c,f=edge[i].f;
			if((dis[v]==-1 || dis[u]+w<dis[v]) && c>f) que.emplace(v,dis[v]=dis[u]+w);
		}
	}
	return ~dis[t];
}
int dfs(int u,int t,int minn)
{
	if(u==t || !minn) return minn;
	vis[u]=1;
	int ans=0;
	for(int &i=cur[u];i;i=nxt[i])
	{
		int v=edge[i].v,w=edge[i].w+h[u]-h[v],c=edge[i].c,f=edge[i].f;
		if(vis[v] || dis[u]+w!=dis[v] || c<=f) continue;
		int x=dfs(v,t,min(minn,c-f));
		edge[i].f+=x;edge[i^1].f-=x;
		ans+=x;minn-=x;
		if(!minn) break;
	}
	return ans;
}
int main()
{
	int n,m,u,v,w,c,flw=0,cst=0;
	cin>>n>>m;
	for(int i=0;i<m;i++)
	{
		scanf("%d%d%d%d",&u,&v,&c,&w);
		addE(u,v,w,c);
	}
	while(Dijk(n,1,n))
	{
		memset(vis+1,0,sizeof(bool)*n);
		memcpy(cur+1,head+1,sizeof(int)*n);
		int x=dfs(1,n,INT_MAX);
		flw+=x;cst+=x*(dis[n]+h[n]);
		for(int i=1;i<=n;i++)
			if(~dis[i]) h[i]+=dis[i];
	}
	cout<<flw<<" "<<cst<<endl;
	return 0;
}