#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;

using ll = long long;
using pii = pair<int, int>;
const ll N = 410, M = 40010, inf = 1e15, SZ = (1 << 18) + 5;
static char buf[SZ], *bgn = buf, *til = buf;
char getc()
{
    if(bgn == til)  bgn = buf, til = buf + fread(buf, 1, SZ, stdin);
    return bgn == til ? EOF : *bgn++;
}
template<typename T>
void read(T &x)
{
    char ch = getc();  T fh = 0;   x = 0;
    while(ch < '0' || ch > '9')    fh |= (ch == '-'), ch = getc();
    while(ch >= '0' && ch <= '9')   x = x * 10 + ch - '0', ch = getc();
    x = fh ? -x : x;
}
template<typename Type, typename... argc>
void read(Type &x, argc &...args)   {read(x), read(args...);}
int n, m, S, T, u, v, up, cnt[N], book[N], vis[N], st[N], idx = 1;
ll cost[M], dis[N], del[N], ci, ans, sum, e[M];
vector<pii> edge[N];
void add(int u, int v, ll d, ll w)
{
    e[++idx] = d, cost[idx] = w, edge[u].pb({v, idx});
    e[++idx] = 0, cost[idx] = -w, edge[v].pb({u, idx});
}
int spfa()
{
    memset(dis, 0x3f, sizeof(dis)), memset(book, 0, sizeof(book));
    memset(st, 0, sizeof(st)), memset(cnt, 0, sizeof(cnt)), memset(vis, 0, sizeof(vis));
    queue<int> q;   q.push(S), dis[S] = 0;
    while(!q.empty())
    {
        int x = q.front();  q.pop();
        book[x] = 0, ++cnt[x];
        if(cnt[x] > n + 1)  {cerr << "!";   exit(0);}
        for(auto [y, i] : edge[x])
            if(e[i] > 0 && dis[y] > dis[x] + cost[i])   
            {
                dis[y] = dis[x] + cost[i];
                if(!book[y])    q.push(y), book[y] = 1;
            }
    }
    return dis[T] < inf ? 1 : 2;
}
ll dinic(int x, ll flow)
{
    if(x == T || !flow) return flow;
    ll res = flow; vis[x] = 1;
    for(int j = st[x]; j < edge[x].size(); ++j)
    {
        st[x] = j;  auto [y, i] = edge[x][j];
        if(e[i] > 0 && !vis[y] && dis[y] == dis[x] + cost[i])
        {
            int k = dinic(y, min(res, e[i]));
            if(k > 0)   e[i] -= k, e[i ^ 1] += k, res -= k, sum += cost[i] * k;
            else    dis[y] = inf;
        }
    }
    vis[x] = 0; return flow - res;
}
int main()
{
    #ifdef Kelly
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        freopen("err.txt", "w", stderr);
    #endif
    read(n, m), S = 1, T = n;
    for(int i = 1; i <= m; ++i)
    {
        read(u, v, up, ci);
        add(u, v, up, ci);
    }
    while(spfa() == 1)  ans += dinic(S, inf);
    cout << ans << " " << sum << "\n";
    return 0;
}