#include<bits/stdc++.h>
#define N 5010
#define pii pair<int,int>
#define inf 0x3f3f3f3f
#define For(i,a,b) for(register int i=a;i<=b;i++)
#define Edge(i,x) for(int i=head[x],to=e[i].t;i;i=e[i].nx,to=e[i].t)
#define EDge(i,x) for(int i=lnk[x],to=e[i].t;i;i=e[i].nx,to=e[i].t)
using namespace std;
int n,m,s,t,head[N],lnk[N];
int cost,dist[N],num=1,h[N];
bool exist[N],vis[N],in[N];
queue<int> nq;
priority_queue<pii> q;
struct E{int nx,t,c,co;}e[N*40];
inline void add(int f,int t,int c,int co){e[++num]=(E){head[f],t,c,co};head[f]=num;}
inline void bio_add(int f,int t,int c,int co){add(f,t,c,co),add(t,f,0,-co);}
inline void SPFA(int st,int en)
{
    For(i,0,n+2) h[i]=inf;
    h[st]=0,nq.push(st);
    while(!nq.empty())
    {
        int k=nq.front();
        nq.pop(),exist[k]=false;
        Edge(i,k) if(e[i].c && h[k]+e[i].co < h[to])
        {
            h[to]=h[k]+e[i].co;
            if(!exist[to]) nq.push(to),exist[to]=true;
        }
    }
    return;
}

inline bool dijkstra(int st,int en)
{
    For(i,0,n+2)
    {
        h[i]+=dist[i],vis[i]=false;
        dist[i]=inf,lnk[i]=head[i];
    }dist[st]=0,q.push(pii(0,st));
    while(!q.empty())
    {
        int k=q.top().second;q.pop();
        if(vis[k]) continue;vis[k]=true;
        Edge(i,k) if(e[i].c && dist[k]+e[i].co+h[k]-h[to] < dist[to])
        {
            dist[to]=dist[k]+e[i].co+h[k]-h[to];
            q.push(pii(-dist[to],to));
        }
    }
    return dist[en]<inf;
}

inline int dinic(int x,int t,int rest)
{
    if(x == t || !rest) return rest;
    int res=0;in[x]=true;
    EDge(i,x)
    {
        lnk[x]=i;
        if(!in[to] && e[i].c && dist[to] == dist[x]+e[i].co+h[x]-h[to])
        {
            int get=dinic(to,t,min(e[i].c,rest-res));
            if(!get) continue;
            e[i].c-=get,e[i^1].c+=get;
            res+=get,cost+=get*e[i].co;
            if(res == rest) break;
        }
    }in[x]=false;
    return res;
}

inline int mcmf(int st,int en)
{
    int ans=0;//SPFA(st,en);
    while(dijkstra(st,en))
    {
        int nw=dinic(st,en,inf);
        while(nw) ans+=nw,nw=dinic(st,en,inf);
    }
    return ans;
}

int main()
{
    scanf("%d%d",&n,&m),s=1,t=n;
    For(i,1,m)
    {
        int x,y,c,w;
        scanf("%d%d%d%d",&x,&y,&c,&w);
        bio_add(x,y,c,w);
    }int flow=mcmf(s,t);
    printf("%d %d\n",flow,cost);
    return 0;
}