#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int inf = INT_MAX;

const int N = 1e5 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + (c ^ 48);
  return x * f;
}

int V, s, t, tot, head[N], d[N], pre[N], mc, mf;
bool in[N];
struct node {
  int nxt, to, f, w;
  node() {}
  node(int v0, int v1, int v2, int v3) : nxt(v0), to(v1), f(v2), w(v3) {}
} e[N];

void adde(int u, int v, int f, int w) {
  e[++tot] = node(head[u], v, f, w), head[u] = tot;
  e[++tot] = node(head[v], u, 0, -w), head[v] = tot;
}

bool spfa() {
  rep(i, 0, V) d[i] = inf;
  queue <int> q;
  d[s] = 0, q.push(s);
  while (q.size()) {
    int u = q.front();
    q.pop(), in[u] = false;
    for (int i = head[u], v; i; i = e[i].nxt) {
      if (!e[i].f || d[v = e[i].to] <= d[u] + e[i].w) continue;
      pre[v] = i, d[v] = d[u] + e[i].w;
      if (!in[v]) q.push(v), in[v] = true;
    }
  }
  return d[t] < inf;
}

void mcmf() {
  while (spfa()) {
    int flow = inf;
    for (int u = t; u != s; u = e[pre[u] ^ 1].to) {
      flow = min(flow, e[pre[u]].f);
    }
    mc += flow * d[t], mf += flow;
    for (int u = t; u != s; u = e[pre[u] ^ 1].to) {
      e[pre[u]].f -= flow, e[pre[u] ^ 1].f += flow;
    }
  }
}

int n, m;

int main() {
  n = read(), m = read(), V = n;
  s = 1, t = n, tot = 1;
  rep(i, 1, m) {
    int u = read(), v = read(), c = read(), w = read();
    adde(u, v, c, w);
  }
  mcmf();
  printf("%d %d\n", mf, mc);
  return 0;
}