#include <bits/stdc++.h>
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
const int N = 5010;
struct edge {
	int dest, flow, cost;
	unsigned pos;
};
vector <edge> v[N];
int n, m, s, t;
void add(int x, int y, int flow, int cost) {
	v[x].push_back((edge) { y, flow, cost, (unsigned) v[y].size() });
	v[y].push_back((edge) { x, 0, -cost, (unsigned) v[x].size() - 1 });
}
queue <int> q;
bool inque[N];
int f[N], path[N], home[N];
bool bfs() {
	F(i, 1, n) f[i] = INT_MAX; f[s] = 0;
	q.push(s);
	while (q.size()) {
		int x = q.front(); q.pop(), inque[x] = false;
		for (unsigned i = 0; i < v[x].size(); ++i)
			if (v[x][i].flow && f[x] + v[x][i].cost < f[v[x][i].dest]) {
				f[v[x][i].dest] = f[x] + v[x][i].cost;
				home[v[x][i].dest] = x;
				path[v[x][i].dest] = i;
				if (!inque[v[x][i].dest]) inque[v[x][i].dest] = true, q.push(v[x][i].dest);
			}
	} return f[t] < INT_MAX;
}
int flow, cost;
void flowpath() {
	int minn = 1e9;
	for (int i = t; i != s; i = home[i]) chkmin(minn, v[home[i]][path[i]].flow);
	flow += minn;
	cost += f[t] * minn;
	for (int i = t; i != s; i = home[i]) v[home[i]][path[i]].flow -= minn, v[i][v[home[i]][path[i]].pos].flow += minn;
}
void ek() {
	while (bfs()) flowpath();
}
signed main() {
	read(n); read(m); s = 1; t = n;
	F(i, 1, m) {
		int x, y, flow, cost; read(x); read(y); read(flow); read(cost);
		add(x, y, flow, cost);
	} ek();
	cout << flow << " " << cost;
	return 0;
}