#include<bits/stdc++.h>
#define int long long
#define ffor(i,a,b) for(int i=(a);i<=(b);i++)
#define roff(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int MAXN=400+10,MAXE=30000+10;
struct Edge {int to,nxt,f,c;}edge[MAXE];
int n,m,mx_flow,mn_cost,tmp,tot=1,hd[MAXN],cur[MAXN],dis[MAXN],in[MAXN];
void add_edge(int u,int v,int f,int c) {
	edge[++tot]={v,hd[u],f,c},hd[u]=tot;
	edge[++tot]={u,hd[v],0,-c},hd[v]=tot;
	return ;	
}
int spfa(void) {
	memset(dis,0x3f,sizeof(dis));
	dis[1]=0; queue<int> q; q.push(1);
	while(!q.empty()) {
		int u=q.front(); q.pop();
		in[u]=0,cur[u]=hd[u];
		for(int i=hd[u];i;i=edge[i].nxt) {
			int to=edge[i].to,c=edge[i].c,f=edge[i].f;
			if(!f) continue ;
			if(dis[u]+c<dis[to]) {
				dis[to]=dis[u]+c;
				if(!in[to]) q.push(to),in[to]=1;	
			}
		}
	}
	return dis[n]!=dis[0];
}
int vis[MAXN];
int dinic(int u,int mx,int &ans) {
	if(u==n) return mx;
	vis[u]=1;
	int res=0;
	for(int i=cur[u];i;i=edge[i].nxt,cur[u]=i) {
		int to=edge[i].to,f=edge[i].f,c=edge[i].c;
		if(!f||vis[to]||dis[to]!=dis[u]+c) continue ;
		int tmp=dinic(to,min(mx,f),ans);
		if(tmp) {
			ans+=c*tmp,edge[i].f-=tmp,edge[i^1].f+=tmp,res+=tmp,mx-=tmp;
			if(!mx) break ;	
		}
		else dis[to]=dis[0];
	}
	return vis[u]=0,res;
}
signed main() {
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n>>m;
	ffor(i,1,m) {
		int u,v,f,c;
		cin>>u>>v>>f>>c;
		add_edge(u,v,f,c);
	}
	while(spfa()) while(tmp=dinic(1,1000000000,mn_cost)) mx_flow+=tmp;
	cout<<mx_flow<<' '<<mn_cost;
	return 0;
}