#include <iostream>
#include <algorithm>
#include <cstdio>
#include <array>
#include <queue>
#include <bitset>
#define ll long long
#define pii pair <int, int>
using namespace std;
#ifdef ONLINE_JUDGE

#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++)
char buf[1 << 23], *p1 = buf, *p2 = buf, ubuf[1 << 23], *u = ubuf;

#endif
int read() {
    int p = 0, flg = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') flg = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        p = p * 10 + c - '0';
        c = getchar();
    }
    return p * flg;
}
void write(ll x) {
    if (x < 0) {
        x = -x;
        putchar('-');
    }
    if (x > 9) {
        write(x / 10);
    }
    putchar(x % 10 + '0');
}
bool _stmer;

#define fi first
#define se second

const int N = 405, M = 3e4 + 5;
const ll inf = 2e18;

namespace G {

array <int, N> fir;
array <int, M> nex, to, len, cap;

int cnt = 1;

void add(int x, int y, int z, int w) {
    cnt++;
    nex[cnt] = fir[x];
    to[cnt] = y;
    cap[cnt] = z;
    len[cnt] = w;
    fir[x] = cnt;
}

void _add(int x, int y, int z, int w) { add(x, y, z, w), add(y, x, 0, -w); }

} //namespace G

namespace Mfl {

array <ll, N> dis;
array <int, N> cur;
bitset <N> vis;

queue <int> q;

bool spfa(pii st) {
    q.push(st.fi);
    dis.fill(inf), dis[st.fi] = 0, vis[st.fi] = 1;
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        vis[u] = 0;
        for (int i = G::fir[u]; i; i = G::nex[i]) {
            if (!G::cap[i] || dis[G::to[i]] <= dis[u] + G::len[i]) continue;
            dis[G::to[i]] = dis[u] + G::len[i];
            if (!vis[G::to[i]])
                q.push(G::to[i]), vis[G::to[i]] = 1;
        }
    }
    return dis[st.se] != inf;
}

ll dfs(int x, ll augcd, pii st) {
    if (x == st.se) return augcd;
    ll augc = augcd;
    vis[x] = 1;
    for (int &i = cur[x]; i; i = G::nex[i]) {
        ll flow = G::cap[i];
        if (!flow || vis[G::to[i]] || dis[G::to[i]] != dis[x] + G::len[i]) continue;
        ll del = dfs(G::to[i], min(flow, augc), st);
        augc -= del;
        G::cap[i] -= del, G::cap[i ^ 1] += del;
        if (!augc) break;
    }
    vis[x] = 0;
    return augcd - augc;
}

pii dinic(pii st) {
    pii ans(0, 0);
    while (spfa(st)) {
        copy(G::fir.begin(), G::fir.end(), cur.begin());
        vis = 0;
        ll flow = dfs(st.fi, inf, st);
        ans.fi += flow, ans.se += flow * dis[st.se];
    }
    return ans;
}

} //namespace Mfl

bool _edmer;
int main() {
    cerr << (&_stmer - &_edmer) / 1024.0 / 1024.0 << "MB\n";
    int n = read(), m = read();
    pii st(1, n), ans(0, 0);
    for (int i = 1; i <= m; i++) {
        int x = read(), y = read(), z = read(), w = read();
        G::_add(x, y, z, w);
    }
    ans = Mfl::dinic(st);
    write(ans.fi), putchar(32);
    write(ans.se), puts("");
    return 0;
}