#include <bits/stdc++.h>

using namespace std;

const int N = 405;
const int M = 15005;
const int inf = 0x3f3f3f3f;

int n, m, s, t;
struct Edge {int v, w, c, nxt;} e[M << 1];
int tot = 1, head[N], cur[N];

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

int dis[N];
bool vis[N];
queue <int> que;

bool spfa()
{
    memset(dis, 0x3f, sizeof(dis));
    memset(vis, 0, sizeof(vis));
    dis[s] = 0; que.push(s); vis[s] = 1;
    while(!que.empty())
    {
        int u = que.front(); que.pop();
        vis[u] = 0; cur[u] = head[u];
        for(int i = head[u]; i; i = e[i].nxt)
        {
            int v = e[i].v;
            if(!e[i].w || dis[v] <= dis[u] + e[i].c) continue;
            dis[v] = dis[u] + e[i].c;
            if(!vis[v]) que.push(v), vis[v] = 1;
        }
    }
    return dis[t] < inf;
}

int dfs(int u, int in)
{
    if(u == t || !in) return in;
    int out = 0; vis[u] = 1;
    for(int &i = cur[u]; i; i = e[i].nxt)
    {
        int v = e[i].v;
        if(vis[v] || !e[i].w || dis[v] != dis[u] + e[i].c) continue;
        int f = dfs(v, min(in, e[i].w));
        e[i].w -= f, e[i ^ 1].w += f;
        in -= f, out += f;
        if(!in) break;
    }
    return out;
}

void solve()
{
    int maxflow = 0, mincost = 0;
    while(spfa())
    {
        int f = dfs(s, inf);
        maxflow += f;
        mincost += f * dis[t];
    }
    cout << maxflow << ' ' << mincost << '\n';
    return;
}

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

	cin >> n >> m; s = 1, t = n;
	for(int i = 1, u, v, w, c; i <= m; i++)
		cin >> u >> v >> w >> c, link(u, v, w, c);
	solve();
	return 0;
}