#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 405;
typedef long long ll;

const ll inf = LLONG_MAX;
struct edge {
    int v, p;
    ll c, f, w;
};
vector<edge> g[N];
int cur[N], nc;

int addv(int cnt) {
    while (cnt--) {
        int p = ++nc;
        g[p].resize(0);
    }
    return nc;
}

void adde(int u, int v, ll c, ll w) {
    g[u].push_back({v, g[v].size(), c, 0, w});
    g[v].push_back({u, g[u].size() - 1, c, c, -w});
}

bool inq[N];
ll dis[N];
bool spfa_mcmf(int s, int t) {
    fill_n(dis + 1, nc, LLONG_MAX);
    queue<int> q;
    q.push(s);
    inq[s] = 1;
    dis[s] = 0;
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        inq[u] = 0;
        for (edge e : g[u]) {
            int v = e.v;
            ll dv = e.w + dis[u];
            if (dis[v] <= dv || e.c == e.f) continue;
            dis[v] = dv;
            if (!inq[v]) q.push(v), inq[v] = 1;
        }
    }
    return dis[t] != LLONG_MAX;
}

ll dfs_mcmf(int u, int t, ll f) {
    if (u == t) return f;
    ll sf = 0;
    inq[u] = 1;
    for (int& i = cur[u]; i != g[u].size(); ++i) {
        edge& e = g[u][i];
        int v = e.v;
        if (e.c == e.f || dis[u] + e.w != dis[v] || inq[v]) continue;
        ll df = dfs_mcmf(v, t, min(f, e.c - e.f));
        e.f += df;
        sf += df;
        f -= df;
        g[v][e.p].f -= df;
        if (!f) break;
    }
    inq[u] = 0;
    return sf;
}

pair<ll, ll> mcmf(int s, int t, ll mf = inf) {
    ll sf = 0, sc = 0;
    while (spfa_mcmf(s, t)) {
        fill_n(cur + 1, nc, 0);
        ll df = dfs_mcmf(s, t, mf);
        mf -= df;
        sf += df;
        sc += dis[t] * df;
    }
    return {sf, sc};
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int x, y;
        ll c, w;
        cin >> x >> y >> c >> w;
        adde(x, y, c, w);
    }
    nc = n + 2;
    auto ans = mcmf(1, n);
    cout << ans.first << " " << ans.second << endl;
}