#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>

typedef long long ll;
typedef double lf;
typedef __int128 LL;

namespace FastIO
{
    const int MAXSIZE = 1 << 20;
    char buf[MAXSIZE], *p1, *p2;
    #define gc (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) ((x) == ' ' || (x) == '\n' || (x) == '\r' || (x) == '\t')
    template <typename T> void Read(T &x)
    {
        x = 0; char ch = gc; bool f = 0;
        while (ch < '0' || ch > '9') {if (ch == '-') f = 1; ch = gc;}
        while (ch >= '0' && ch <= '9') x = x * 10 + (ch ^ 48), ch = gc;
        if (f) x = -x;
    }
    void Read(char *s)
    {
        char ch = gc;
        while (blank(ch)) ch = gc;
        while (!blank(ch)) *s++ = ch, ch = gc;
        *s = 0;
    }
}

using namespace std;
using FastIO::Read;

const int MAXN = 410, MAXM = 15e3 + 10;

int n, m, s, t;

struct Edge
{
    int v, nxt, c, f, w;
}e[MAXM << 1];
int head[MAXN], tot;
inline void AddEdge(int u, int v, int c, int w)
{
    e[++tot] = Edge{v, head[u], c, 0, w}, head[u] = tot;
    e[++tot] = Edge{u, head[v], 0, 0, -w}, head[v] = tot;
}
ll dis[MAXN]; bool vis[MAXN];
ll fl[MAXN]; int pth[MAXN];
queue <int> q;
bool SPFA()
{
    for (int i = 1; i <= n; i++) dis[i] = 1e18, vis[i] = 0;
    dis[s] = 0, fl[s] = 1e18, q.push(s);
    while (!q.empty())
    {
        int u = q.front(); q.pop();
        vis[u] = 0;
        for (int i = head[u]; ~i; i = e[i].nxt)
        {
            int v = e[i].v;
            if (dis[v] > dis[u] + e[i].w && e[i].c > e[i].f)
            {
                dis[v] = dis[u] + e[i].w, fl[v] = min(fl[u], (ll)e[i].c - e[i].f), pth[v] = i;
                if (!vis[v]) q.push(v), vis[v] = 1;
            }
        }
    }
    return dis[t] != 1e18;
}
inline void MCMF()
{
    ll flow = 0, cst = 0;
    while (SPFA())
    {
        flow += fl[t], cst += fl[t] * dis[t];
        for (int u = t; u != s; u = e[pth[u] ^ 1].v)
            e[pth[u]].f += fl[t], e[pth[u] ^ 1].f -= fl[t];
    }
    cout << flow << ' ' << cst << "\n";
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0);
    memset(head, -1, sizeof(head)), tot = -1;
    Read(n), Read(m), s = 1, t = n;
    for (int i = 1, u, v, c, w; i <= m; i++) Read(u), Read(v), Read(c), Read(w), AddEdge(u, v, c, w);
    MCMF();
    return 0;
}