#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 405;
const int maxm = 15005;
const ll inf = 1e18;

int s, t;

struct edge
{
    int v, next;
    ll w, flow;
}e[maxm << 1];
int head[maxn], tot;

inline void addedge(int u, int v, ll c, ll w)
{
    e[++tot] = (edge){v, head[u], w, c}; head[u] = tot;
    e[++tot] = (edge){u, head[v], -w, 0}; head[v] = tot;
}

int vis[maxn], pre[maxn];
ll dis[maxn], maxflow, mincost;

bool bfs()
{
    memset(dis, 0x3f, sizeof(dis));
    memset(vis, 0, sizeof(vis));
    memset(pre, -1, sizeof(pre));
    queue<int> q;
    q.push(s), dis[s] = 0, vis[s] = 1;
    while (q.size())
    {
        int u = q.front(); q.pop();
        vis[u] = 0;
        for (int i = head[u]; ~i; i = e[i].next)
        {
            int v = e[i].v;
            if (dis[v] > dis[u] + e[i].w && e[i].flow)
            {
                dis[v] = dis[u] + e[i].w;
                pre[v] = i;
                if (!vis[v])
                {
                    q.push(v);
                    vis[v] = 1;
                }
            }
        }
    }
    return pre[t] != -1;
}

void MCMF()
{
    maxflow = mincost = 0;
    while (bfs())
    {
        ll d = inf;
        for (int i = pre[t]; ~i; i = pre[e[i ^ 1].v]) d = min(d, e[i].flow);
        maxflow += d, mincost += dis[t] * d;
        for (int i = pre[t]; ~i; i = pre[e[i ^ 1].v])
            e[i].flow -= d, e[i ^ 1].flow += d;
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    cin >> n >> m, s = 1, t = n;
    memset(head, -1, sizeof(head)), tot = -1;
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        ll c, w;
        cin >> u >> v >> c >> w;
        addedge(u, v, c, w);
    }
    MCMF();
    cout << maxflow << " " << mincost;
    return 0;
}