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

#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
char *p1, *p2, buf[1000000];
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++)
#define pc(c) putchar(c)
inline int read() {int x=0,f=1;char c=gc();while(!isdigit(c)){if(c=='-')f=-1;c=gc();};while(isdigit(c))x=x*10+c-'0',c=gc();return x*f;}
void write(int x) {if(x<0)pc('-'),x=-x;if(x>9)write(x/10);pc('0'+x%10);}

int n, m;
int head[410], cur[410], vis[410], dis[410];
struct Edge {int to, nxt, f, c, w;} e[30010];
int tot = 1;
int S, T, cost;

inline void add_edge(int u, int v, int c, int w) {
    e[++tot] = {v, head[u], 0, c, w};
    head[u] = tot;
    e[++tot] = {u, head[v], 0, 0, -w};
    head[v] = tot;
}

int dfs(int u, int f) {
    if (u == T || !f) return f;
    if (vis[u]) return 0;
    vis[u] = 1;
    int ret = 0;
    for (int &i = cur[u]; i && ret < f; i = e[i].nxt) {
        int v = e[i].to, w = e[i].w, d;
        if (vis[v]) continue;
        if (dis[u] + w == dis[v] &&
            (d = dfs(v, min(f - ret, e[i].c - e[i].f)))) {
            e[i].f += d;
            e[i ^ 1].f -= d;
            ret += d;
            cost += d * e[i].w;
        }
    }
    vis[u] = 0;
    return ret;
}

inline bool spfa() {
    memset(vis, 0, sizeof(vis));
    memset(dis, 0x3f, sizeof(dis));
    queue<int> Q;
    Q.push(S); dis[S] = 0, vis[S] = 1;
    while (!Q.empty()) {
        int u = Q.front(); Q.pop(); vis[u] = 0;
        for (int i = head[u]; i; i = e[i].nxt) {
            int v = e[i].to, w = e[i].w;
            if (!(e[i].c - e[i].f)) continue;
            if (dis[u] + w < dis[v]) {
                dis[v] = dis[u] + w;
                if (!vis[v]) Q.push(v), vis[v] = 1;
            }
        }
    }
    return dis[T] != INF;
}

inline int mcmf() {
    int f = 0;
    while (spfa()) {
        memcpy(cur, head, sizeof(head));
        f += dfs(S, INF);
    }
    return f;
}

signed main() {
    n = read(), m = read();
    for (int i = 1; i <= m; i++) {
        int u = read(), v = read(), c = read(), w = read();
        add_edge(u, v, c, w);
    }
    S = 1, T = n;
    int f = mcmf();
    write(f); pc(' '); write(cost); pc('\n');
}