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

using i64 = long long;

struct mcflow {
    struct Edge {
        int v, f, c;
        Edge(int v, int f, int c) : v(v), f(f), c(c) {}
    };

    const int n;
    vector<Edge> edges;
    vector<vector<int>> e;
    vector<i64> h, dis;
    vector<int> pre;

    mcflow(int n) : n(n), e(n) {}

    void addedge(int u, int v, int f, int c) {
        e[u].push_back(edges.size());
        edges.emplace_back(v, f, c);
        e[v].push_back(edges.size());
        edges.emplace_back(u, 0, -c);
    }

    bool Dijstra(int s, int t) {
        dis.assign(n, LONG_LONG_MAX);
        pre.assign(n, -1);
        priority_queue<pair<i64, int>, vector<pair<i64, int>>, greater<pair<i64, int>>> pq;
        dis[s] = 0;
        pq.emplace(0, s);
        while (!pq.empty()) {
            auto [d, u] = pq.top();
            pq.pop();
            if (dis[u] < d) {
                continue;
            }
            for (int i : e[u]) {
                auto [v, f, c] = edges[i];
                if (f > 0 && dis[v] > d + h[u] - h[v] + c) {
                    dis[v] = d + h[u] - h[v] + c;
                    pre[v] = i;
                    pq.emplace(dis[v], v);
                }
            }
        }
        return dis[t] != LONG_LONG_MAX;
    }

    pair<int, i64> flow(int s, int t) {
        int flow = 0;
        i64 cost = 0;
        h.assign(n, 0);
        while (Dijstra(s, t)) {
            for (int i = 0; i < n; i++) {
                h[i] += dis[i];
            }
            int aug = INT_MAX;
            for (int i = t; i != s; i = edges[pre[i] ^ 1].v) {
                aug = min(aug, edges[pre[i]].f);
            }
            for (int i = t; i != s; i = edges[pre[i] ^ 1].v) {
                edges[pre[i]].f -= aug;
                edges[pre[i] ^ 1].f += aug;
            }
            flow += aug;
            cost += i64(aug) * h[t];
        }

        return make_pair(flow, cost);
    }
};

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

    int n, m;
    cin >> n >> m;

    mcflow mf(n);
    for (int i = 0; i < m; i++) {
        int u, v, c, w;
        cin >> u >> v >> c >> w;
        u--;
        v--;
        mf.addedge(u, v, c, w);
    }

    auto ans = mf.flow(0, n - 1);
    cout << ans.first << " " << ans.second << "\n";

    return 0;
}