#include <bits/stdc++.h>
using namespace std;
const int MAXN = 405, MAXM = 30005;
const long long inf = 0x3f3f3f3f3f3f3f3f;
struct Graph {
    int fst[MAXN], now[MAXN], to[MAXM], nxt[MAXM];
    long long d[MAXN], f[MAXM], c[MAXM];
    int tot, s, t;
    Graph() : tot(1) {}
    void add(int u, int v, int w, int cc) {
        to[++tot] = v, nxt[tot] = fst[u], fst[u] = tot, f[tot] = w, c[tot] = cc;
        to[++tot] = u, nxt[tot] = fst[v], fst[v] = tot, f[tot] = 0, c[tot] = -cc;
    }
    bool vis[MAXN];
    bool spfa() {
        memcpy(now, fst, sizeof fst);
        memset(d, 0x3f, sizeof d);
        queue<int> q; q.push(s); d[s] = 0;
        while (!q.empty()) {
            int u = q.front(); q.pop(); vis[u] = 0;
            for (int i = fst[u], v = to[i]; i; i = nxt[i], v = to[i]) {
                if (f[i] && d[v] > d[u] + c[i]) {
                    d[v] = d[u] + c[i];
                    if (!vis[v]) vis[v] = 1, q.push(v);
                }
            }
        }
        return d[t] != inf;
    }
    long long dfs(int u, long long flow, long long &cost) {
        if (u == t) return flow;
        long long rest = flow;
        vis[u] = 1;
        for (int &i = now[u], v = to[i]; i; i = nxt[i], v = to[i]) {
            if (!vis[v] && f[i] && d[v] == d[u] + c[i]) {
                long long k = dfs(v, min(rest, f[i]), cost);
                if (!k) d[v] = inf;
                f[i] -= k, f[i ^ 1] += k, rest -= k, cost += k * c[i];
            }
            if (!rest) break;
        }
        vis[u] = 0;
        return flow - rest;
    }
    pair<long long, long long> mcmf() {
        long long flow, maxflow = 0, cost = 0;
        while (spfa()) while (flow = dfs(s, inf, cost)) maxflow += flow;
        return { maxflow, cost };
    }
} g;
int n, m;
int main() {
    scanf("%d%d", &n, &m);
    g.s = 1, g.t = n;
    for (int i = 1; i <= m; i++) {
        int u, v, c, w; scanf("%d%d%d%d", &u, &v, &c, &w);
        g.add(u, v, c, w);
    }
    auto ans = g.mcmf();
    printf("%lld %lld\n", ans.first, ans.second);
    return 0;
}