#include <bits/stdc++.h>
#define rep(a, b, c) for (int a = b; a <= c; a++)
#define ALL(x) (x).begin(), (x).end()
#define IOS cin.tie(0)->sync_with_stdio(false)
#ifdef LOCAL
#include "debug.h"
#else
#define deb(...) 42
#endif
#define OPENSTACK
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const int MAXN = 2e5 + 5;
const int INF = 0x3f3f3f3f;
namespace MCF {
    const int N = 1e4 + 5, M = 1e6 + 5;
    struct edge {
        int next, to, w;
        ll c;
    } e[M << 1];
    int n, s, t;
    int head[N], cnt, pre[N];
    ll h[N], dis[N];
    void init(int n_, int s_, int t_)
    {
        s = s_, t = t_, n = n_, cnt = 0;
        for (int i = 0; i < n; i++) head[i] = -1;
    }
    void add_edge(int u, int v, int w, ll c)
    {
        if (c < 0) {
            assert(u <= n && v <= n);
            e[cnt] = edge{ head[u], v, 0,c };
            head[u] = cnt;
            cnt++;
            e[cnt] = edge{ head[v], u, w ,-c };
            head[v] = cnt;
            cnt++;
        }
        else {
            assert(u <= n && v <= n);
            e[cnt] = edge{ head[u], v, w,c };
            head[u] = cnt;
            cnt++;
            e[cnt] = edge{ head[v], u, 0,-c };
            head[v] = cnt;
            cnt++;
        }
    }
    bool dijkstra()
    {
        for (int i = 0; i < n; i++)  dis[i] = numeric_limits<ll>::max(), pre[i] = -1;
        priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q;
        dis[s] = 0;
        q.emplace(0, s);
        while (!q.empty()) {
            auto [d, x] = q.top();
            q.pop();
            if (dis[x] < d) continue;
            for (int i = head[x]; i != -1; i = e[i].next) {
                int y = e[i].to;
                ll c = e[i].c;
                int w = e[i].w;
                if (w > 0 && dis[y] > d + h[x] - h[y] + c) {
                    dis[y] = d + h[x] - h[y] + c;
                    pre[y] = i;
                    q.emplace(dis[y], y);
                }
            }
        }
        return dis[t] != numeric_limits<ll>::max();
        // 最小费用可行流
        // if (dis[t] == numeric_limits<ll>::max() || h[t] + dis[t] >= 0)return false;
        // else return true;

    }

    pair<int, ll> flow()
    {
        int flow = 0;
        ll cost = 0;
        for (int i = 0; i < n; i++)h[i] = 0;
        while (dijkstra()) {
            for (int i = 0; i < n; i++) h[i] += dis[i];
            int aug = numeric_limits<int>::max();
            for (int i = t; i != s; i = e[pre[i] ^ 1].to) aug = min(aug, e[pre[i]].w);
            for (int i = t; i != s; i = e[pre[i] ^ 1].to) {
                e[pre[i]].w -= aug;
                e[pre[i] ^ 1].w += aug;
            }
            flow += aug;
            cost += ll(aug) * h[t];
        }
        return make_pair(flow, cost);
    }
};  // namespace flow
using MCF::add_edge;
using MCF::flow;
using MCF::init;
void solve()
{
    int n, m, s, t;
    cin >> n >> m;
    s = 1, t = n;
    init(t + 1, s, t);
    ll ans = 0;
    for (int i = 0; i < m; i++) {
        int x, y, w, c;
        cin >> x >> y >> w >> c;
        add_edge(x, y, w, c);
    }
    auto [fl, co] = flow();
    cout << fl << " " << co << "\n";
}
signed main()
{
#ifdef LOCAL
#ifdef OPENSTACK
    int size = 128 << 20; // 64MB
    char* p = (char*) malloc(size) + size;
#if (defined _WIN64) or (defined __unix)
    __asm__("movq %0, %%rsp\n" ::"r"(p));
#else
    __asm__("movl %0, %%esp\n" ::"r"(p));
#endif
#endif
#endif
    IOS;
    int _ = 1;
    while (_--) {
        solve();
    }
#ifdef LOCAL
#ifdef OPENSTACK
    exit(0);
#else
    return 0;
#endif
#endif
}