// Problem: 15. 最小费用最大流（随机数据）
// URL: https://qoj.ac/contest/1536/problem/602
// Writer: WRuperD
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int mininf = 1e9 + 7;
#define int long long
#define pb emplace_back
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
inline void write(int x){if(x<0){x=~(x-1);putchar('-');}if(x>9)write(x/10);putchar(x%10+'0');}
#define put() putchar(' ')
#define endl puts("")
const int MAX = 405;
int n;

struct node{
	int v, w, w2, cp;
}; vector <node> g[MAX];

bool vis[MAX];
int dis[MAX];

bool bfs(int s, int t){
	for(int i = 1; i <= n; i++)	dis[i] = inf, vis[i] = 0;
	queue <int> que;
	dis[s] = 0;
	que.push(s);
	while(!que.empty()){
		int u = que.front();
		que.pop();
		vis[u] = 0;
		for(auto V : g[u]){
			int v = V.v, w = V.w, w2 = V.w2;
			if(!w or dis[v] <= dis[u] + w2)	continue;
			dis[v] = dis[u] + w2;
			if(!vis[v])	que.push(v), vis[v] = 1;
		} 
	}
	// cerr << 1 << '\n';
	if(dis[t] == inf)	return false;
	return true;
}

int cur[MAX];
bool vis2[MAX];

int aug(int u, int now, int &cst, int t){
	if(u == t)	return now;
	if(!now)	return 0;
	vis2[u] = 1;
	int ans = 0;
	for(int &i = cur[u]; i < g[u].size(); i++){
		int v = g[u][i].v, w = g[u][i].w, w2 = g[u][i].w2, cp = g[u][i].cp;
		if(!w or dis[v] != dis[u] + w2 or vis2[v])	continue;
		int ret = aug(v, min(now, w), cst, t);
		ans += ret, now -= ret;
		g[u][i].w -= ret, g[v][cp].w += ret;
		cst += ret * w2;
		if(!now)	break;
	}
	vis2[u] = 0;
	return ans;
}

void solve(){
	n = read(); int m = read(), s = 1, t = n;
	for(int i = 1; i <= m; i++){
		int u = read(), v = read(), w = read(), w2 = read();
		g[u].pb(node{v, w, w2, g[v].size()});
		g[v].pb(node{u, 0, -w2, g[u].size() - 1});
	}	
	int ans = 0, cst = 0;
	while(bfs(s, t)){
		for(int i = 1; i <= n; i++)	cur[i] = 0;
		ans += aug(s, inf, cst, t);
	}
	write(ans), put(), write(cst), endl;
}

signed main(){
	int t = 1;
	while(t--)	solve();
	return 0;
}