#include <bits/stdc++.h>
const int N = 407, M = 15007, E = M * 2, inf = 0x3f3f3f3f;
int n, m;
struct
{
    int v, rest, p, nxt;
} e[E];
int tot = 1, head[N], dis[N], pre[N], vis[N];
void Add(int u, int v, int c, int p) { e[++tot] = {v, c, p, head[u]}, head[u] = tot; }
int SPFA()
{
    std::queue<int> que;
    for (int i = 1; i <= n; ++i)
        dis[i] = inf, pre[i] = 0;
    dis[1] = 0;
    vis[1] = 1;
    que.push(1);
    while (!que.empty())
    {
        int u = que.front();
        // fprintf(stderr, "%d\n", u);
        que.pop();
        vis[u] = 0;
        for (int i = head[u]; i; i = e[i].nxt)
        {
            auto &x = e[i];
            if (x.rest && dis[u] + x.p < dis[x.v])
            {
                dis[x.v] = dis[u] + x.p, pre[x.v] = i;
                if (!vis[x.v])
                    que.push(x.v), vis[x.v] = 1;
            }
        }
    }
    return dis[n] != inf;
}
int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; ++i)
    {
        int u, v, c, p;
        scanf("%d%d%d%d", &u, &v, &c, &p);
        Add(u, v, c, p), Add(v, u, 0, -p);
    }
    int ans1 = 0, ans2 = 0;
    while (SPFA())
    {
        // fprintf(stderr, "***\n");
        int u = n;
        int f = inf;
        while (u > 1)
        {
            f = std::min(f, e[pre[u]].rest);
            u = e[pre[u] ^ 1].v;
        }
        ans1 += f;
        ans2 += dis[n] * f;
        u = n;
        while (u > 1)
        {
            e[pre[u]].rest -= f;
            e[pre[u] ^ 1].rest += f;
            u = e[pre[u] ^ 1].v;
        }
    }
    printf("%d %d\n", ans1, ans2);
    return 0;
}