#include<bits/stdc++.h>

#define ll long long
#define pi pair<ll,ll>
#define vi vector<ll>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array
#define eb emplace_back
#define IL inline
#define For(i,j,k) for(ll i=(j);i<=(k);i++)
#define Fol(i,k,j) for(ll i=(k);i>=(j);i--)

using namespace std;

#define inf 0x3f3f3f3f3f3f3f3f
#define N 1000005

ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(ll x){
    if(x<0)x=-x,putchar('-'); 
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

void debug(auto &&...x){
    ((cerr<<x<<' '),...);
    cerr<<'\n';
}

ll e=1,nex[N],head[N],to[N],cur[N],dis[N],edg[N],ct[N],vis[N];
queue<int> q;
ll n,m,S,T;
void add_edg(ll u,ll v,ll w,ll c){
    to[++e]=v;nex[e]=head[u];head[u]=e;edg[e]=w;ct[e]=c;
    to[++e]=u;nex[e]=head[v];head[v]=e;edg[e]=0;ct[e]=-c;
}


bool spfa(ll S,ll T){
    while(q.size())q.pop();
    For(i,1,n)cur[i]=head[i],dis[i]=inf,vis[i]=0;dis[S]=0;q.push(S);vis[S]=1;
    while(q.size()){
        ll u=q.front();q.pop();vis[u]=0;
        for(ll i=head[u];i;i=nex[i]){
            ll v=to[i];if(!edg[i])continue;
            if(dis[u]+ct[i]<dis[v]){
                dis[v]=dis[u]+ct[i];
                if(!vis[v])q.push(v),vis[v]=1;
            }
        }
    }
    For(i,1,n)vis[i]=0;
    if(dis[T]!=inf)return true;
    return false;
}

ll C=0;

ll dfs(ll x,ll res,ll T){
    if(x==T)return res;
    ll ans=0;vis[x]=1;
    for(ll i=cur[x];i && res;i=nex[i]){
        cur[x]=i;
        ll v=to[i];if(vis[v] || dis[v]!=dis[x]+ct[i] || !edg[i])continue;
        ll d=dfs(v,min(res,edg[i]),T);
        edg[i]-=d;edg[i^1]+=d;res-=d;ans+=d;C+=ct[i]*d;
        if(!d)dis[v]=inf;
    }
    vis[x]=0;
    return ans;
}

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    #endif

    n=read(),m=read(),S=1,T=n;
    For(i,1,m){
        ll u=read(),v=read(),w=read(),c=read();
        add_edg(u,v,w,c);
    }
    ll maxflow=0;
    while(spfa(S,T))maxflow+=dfs(S,inf,T);
    write(maxflow);putchar(' ');write(C);
    return 0;
}