#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf INT_MAX
#define fr(i,l,r) for (i=(l); i<=(r); i++)
#define rfr(i,l,r) for (i=(l); i>=(r); i--)
template<typename T>inline void read(T &n){
    T w=1; n=0; char ch=getchar();
    while (!isdigit(ch) && ch!=EOF){ if (ch=='-') w=-1; ch=getchar(); }
    while (isdigit(ch) && ch!=EOF){ n=(n<<3)+(n<<1)+(ch&15); ch=getchar(); }
    n*=w;
}
template<typename T>inline void write(T x){
    if (x==0){ putchar('0'); return ; }
    T tmp;
    if (x>0) tmp=x;
    else tmp=-x;
    if (x<0) putchar('-');
    char F[105];
    long long cnt=0;
    while (tmp){
        F[++cnt]=tmp%10+48;
        tmp/=10;
    }
    while (cnt) putchar(F[cnt--]);
}
#define Min(x,y) x = min(x,y)
#define Max(x,y) x = max(x,y)
//基础配置=================================================================================
struct Cost_flow{
    #define N 405
    #define M 15005
    struct edge{
        ll x,y,w,c;
    };
    ll n,m,S,T;
    ll cnt,head[N]; edge e[M+M];
    ll nw[N]; bool vis[N];
    ll f[N],h[N];
    void init(ll _n){
        ll i;
        n = _n;
        cnt = 1;
        fr(i,0,n) head[i] = 0;
    }
    void Addedge(ll x,ll y,ll w,ll c){
        cnt++;
        e[cnt].x = head[x];
        e[cnt].y = y;
        e[cnt].w = w;
        e[cnt].c = c;
        head[x] = cnt;
    }
    void addedge(ll x,ll y,ll w,ll c){
        Addedge(x,y,w,c);
        Addedge(y,x,0,-c);
    }
    struct node{
        ll x,v;
        node(ll _x=0,ll _v=0){
            x = _x, v = _v;
        }
        bool operator < (const node o)const{
            return v>o.v;
        }
    };
    void spfa(ll x){
        ll i, go;
        bool vis[N]; memset(vis,false,sizeof(vis));
        queue<ll> q;
        memset(h,0x3f,sizeof(h)); h[x] = 0; q.push(x), vis[x] = true;
        while (!q.empty()){
            x = q.front(); q.pop();
            vis[x] = false;//printf("h[%lld] = %lld\n",x,h[x]);
            for (i=head[x]; i; i=e[i].x){
                go = e[i].y;
                if (e[i].w>0 && h[x]+e[i].c<h[go]){
                    h[go] = h[x]+e[i].c;
                    if (!vis[go]) q.push(go), vis[go] = true;
                }
            }
        }
    }
    bool dij(ll x){
        ll i, go;
        priority_queue<node> q;
        fr(i,0,n+1) f[i] = inf;
        f[x] = 0, q.push(node(x,0));
        while (!q.empty()){
            node p = q.top(); q.pop();
            ll x = p.x, v = p.v;
            if (v>f[x]) continue;
            // printf("f[%lld] = %lld\n",x,f[x]);
            for (i=head[x]; i; i=e[i].x){
                go = e[i].y;
                ll ev = h[x]+e[i].c - h[go];
                if (e[i].w>0 && v+ev<f[go]){
                    f[go] = v+ev;
                    q.push(node(go,f[go]));
                    if (go==T) return true;
                }
            }
        }
        return false;
        // return f[T]<inf;
    }
    ll dfs(ll x,ll flow){
        if (x==T) return flow;
        ll i, go, k, ans = 0;
        vis[x] = false;
        for (i=nw[x]; i && flow; i=e[i].x){
            go = e[i].y; nw[x] = i;
            if (e[i].w==0 || !vis[go] || h[x]+e[i].c!=h[go]) continue;
            k = dfs( go , min(flow,e[i].w) );
            ans += k, flow -= k;
            e[i].w -= k, e[i^1].w += k;
        }
        vis[x] = (ans>0);
        return ans;
    }
    pair<ll,ll> dinic(ll _S,ll _T){
        ll i, ans = 0, av = 0;
        S = _S, T = _T;
        // printf("dinic %lld %lld\n",S,T);
        spfa(S);
        // printf("h[T] = %lld\n",h[T]);
        while (dij(S)){
            fr(i,0,n) h[i] += f[i], nw[i] = head[i], vis[i] = true;
            // printf("h[T] = %lld\n",h[T]);
            ll k = dfs(S,inf);
            ans += k, av += h[T]*k;
        }
        return make_pair(ans,av);
    }
};
ll n,m,s,t;
Cost_flow flow;
int main(){
	// freopen("a.in","r",stdin);
//	freopen(".out","w",stdout);
    ll i;
    read(n); read(m);
    flow.init(n);
    fr(i,1,m){
        ll x,y,w,c;
        read(x); read(y); read(w); read(c);
        flow.addedge(x,y,w,c);
    }
    pair<ll,ll> ans = flow.dinic(1,n);
    printf("%lld %lld\n",ans.first,ans.second);
    return 0;
}
//g++ a.cpp -o a -Wall -Wl,--stack=512000000 -std=c++11 -O2