#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 Inf 1e18
    #define N 505
    #define M 15005
    struct edge{
        ll x,y,w,c;
    };
    ll n;
    ll cnt=1,head[N];
    edge e[2*M];
    void init(ll _n){
        n = _n;
        cnt = 1;
        for (ll i=0; i<=n+1; i++) 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);
    }
    ll S,T;
    ll f[N],h[N];
    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;
        }
    };
    bool dij(ll x){
        ll i;
        fr(i,0,n) f[i] = Inf;
        f[x] = 0;
        priority_queue<node> q;
        q.push(node(x,0));
        while (!q.empty()){
            node p = q.top(); q.pop();
            x = p.x;
            if (p.v>f[x]) continue;
            for (i=head[x]; i; i=e[i].x){
                ll go = e[i].y;
                if (e[i].w>0 && f[x]+h[x]+e[i].c-h[go]<f[go]){
                    f[go] = f[x]+h[x]+e[i].c-h[go];
                    q.push(node(go,f[go]));
                }
            }
        }
        return f[T]<Inf;
    }
    void spfa(ll x){
        ll i,j;
        fr(i,0,n) vis[i] = false;
        fr(i,0,n) f[i] = Inf;
        queue<ll> q;
        f[x] = 0; vis[x] = true; q.push(x);
        while (!q.empty()){
            x = q.front(); q.pop();
            vis[x] = false;
            for (i=head[x]; i; i=e[i].x){
                ll go = e[i].y;
                if (e[i].w>0 && f[x]+e[i].c<f[go]){
                    f[go] = f[x]+e[i].c;
                    if (!vis[go]){
                        vis[go] = true;
                        q.push(go);
                    }
                }
            }
        }
    }
    ll nw[N];
    bool vis[N];
    ll dfs(ll x,ll flow){
        if (x==T) return flow;
        vis[x] = true;
        ll i; ll go,k,ans=0;
        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));
            e[i].w -= k; e[i^1].w += k;
            flow -= k; ans += k;
        }
        if (ans) vis[x] = false;
        return ans;
    }
    pair<ll,ll> dinic(ll _S,ll _T){
        S = _S; T = _T;
        ll ans1 = 0 , ans2 = 0;
        for (ll i=0; i<=n; i++) h[i] = 0;
        spfa(S);
        for (ll i=0; i<=n; i++) nw[i] = head[i] , h[i] += f[i] , vis[i] = false;
        while (dij(S)){
            for (ll i=0; i<=n; i++) nw[i] = head[i] , h[i] += f[i] , vis[i] = false;
            ll v = dfs(S,Inf);
            ans1 += v;
            ans2 += v*h[T];
        }
        return make_pair(ans1,ans2);
    }
    #undef N
    #undef M
    #undef Inf
};
ll n,m;
COST_FLOW flow;
int main(){
//	freopen(".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;
    return 0;
}
//g++ a.cpp -o a -Wall -Wl,--stack=512000000 -std=c++11 -O2