#if defined(LOCAL)
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif

#include <bits/stdc++.h>

#if defined(LOCAL)
#define DBG_MACRO_NO_WARNING
#include <dbg.hpp>
#else
#define dbg(x...) (0)
#endif

using namespace std;

using ll = long long;

// #define int ll
#define rep(i, f, t) for (int i = (f), ed##i = (t); i <= ed##i; ++i)
#define re(i, t) rep (i, 1, t)
#define per(i, t, f) for (int i = (t), ed##i = (f); i >= ed##i; --i)
#define ste(i, f, t, s) for (int i = (f), ed##i = (t); i <= ed##i; i += s)
#define nxt(i, f, g) for (int i = g.h[f]; i; i = g.e[i].n)
#define umod(x) ((x) >= mo && ((x) -= mo))
#define dmod(x) ((x) < 0 && ((x) += mo))
#define y1 y1__
#define fio(x) (freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout))

template <class T, class E>
__attribute__((always_inline)) inline void up(T &x, E &&y) {
  if (x < y) x = y;
}
template <class T, class E>
__attribute__((always_inline)) inline void down(T &x, E &&y) {
  if (y < x) x = y;
}

const int N = 1e6 + 9;
const ll inf = 0x3f3f3f3f3f3f3f3fll;

struct G {
  int tot = 1, h[N];
  struct E {
    int t, n;
    ll ca, fl, co;
  } e[N << 1];
  inline void Add(int f, int t, ll ca, ll fl, ll co) {
    e[++tot] = {t, h[f], ca, fl, co}, h[f] = tot;
  }
} g;

inline void Add(int f, int t, ll fl, ll co) {
  g.Add(f, t, fl, 0, co);
  g.Add(t, f, 0, 0, -co);
}

int cur[N];
ll dis[N];
bool vis[N];

inline bool Bfs(int S, int T, int n) {
  re (i, n) dis[i] = 0x3f3f3f3f3f3f3f3fll, vis[i] = 0;
  queue<int> q;
  q.push(S);
  vis[S] = 1;
  dis[S] = 0;
  while (q.size()) {
    int f = q.front();
    q.pop();
    vis[f] = 0;
    nxt (i, f, g) {
      if (g.e[i].fl >= g.e[i].ca) continue;
      int t = g.e[i].t;
      ll co = g.e[i].co;
      if (dis[f] + co < dis[t]) {
        dis[t] = dis[f] + co;
        if (!vis[t]) q.push(t);
      }
    }
  }
  return dis[T] < inf;
}

inline pair<ll, ll> Dfs(int f, ll fl, int T) {
  if (!fl || f == T) return {fl, 0};
  ll ou = 0, co = 0;
  vis[f] = 1;
  for (int &i = cur[f]; i; i = g.e[i].n) {
    int t = g.e[i].t;
    pair<ll, ll> tmp;
    if (!vis[t] && dis[t] == dis[f] + g.e[i].co &&
        (tmp = Dfs(t, min(fl, g.e[i].ca - g.e[i].fl), T)).first) {
      fl -= tmp.first, ou += tmp.first, g.e[i].fl += tmp.first, g.e[i ^ 1].fl -= tmp.first;
      co += tmp.second + tmp.first * g.e[i].co;
    }
  }
  if (!ou) dis[f] = inf;
  vis[f] = 0;
  return {ou, co};
}

inline pair<ll, ll> Dinic(int S, int T, int n) {
  ll fl = 0, co = 0;
  while (1) {
    if (!Bfs(S, T, n)) break;
    // cerr << "BFS!\n";
    re (i, n) cur[i] = g.h[i];
    auto tmp = Dfs(S, inf, T);
    fl += tmp.first, co += tmp.second;
  }
  return {fl, co};
}

int n, m, S, T;

signed main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  S = 1, T = n;
  re (i, m) {
    int f, t;
    ll fl, co;
    cin >> f >> t >> fl >> co;
    Add(f, t, fl, co);
  }
  auto [fl, co] = Dinic(S, T, n);
  cout << fl << ' ' << co << '\n';
  return 0;
}