//Date: 2025-02-27 15:09:33
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define P emplace_back
#define CLEAR(a,v) memset(a,(v),sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
//char buf[1<<20],*p1,*p2;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
inline int rd() {
    int s=0,m=0;char ch=getchar();
    while(!isdigit(ch)) {if(ch=='-')m=1;ch=getchar();}
    while( isdigit(ch)) s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
    return m?-s:s;
}
bool MBE;
namespace SOLVER {
int n,m,S,T,h[405],cnt=1;struct Edge{int v,w,c,nxt;} e[30005];
void add(int u,int v,int w,int c) {e[++cnt]={v,w,c,h[u]},h[u]=cnt,e[++cnt]={u,0,-c,h[v]},h[v]=cnt;}
int vis[405],d[405],flo[405],pre[405];
int SPFA() {
    CLEAR(vis,0),CLEAR(d,0x3f),CLEAR(flo,0);queue<int> q;q.push(S),vis[S]=1,d[S]=0,flo[S]=1e18;
    while(q.size()) {
        int u=q.front();q.pop();vis[u]=0;
        for(int i=h[u],v;v=e[i].v;i=e[i].nxt) if(e[i].w&&d[v]>d[u]+e[i].c) 
            {d[v]=d[u]+e[i].c,flo[v]=min(flo[u],e[i].w),pre[v]=i;if(!vis[v]) q.push(v),vis[v]=1;}
    }return d[T];
}
void MAIN() {
    cin>>n>>m;S=1,T=n;rep(i,1,m) {int u=rd(),v=rd(),w=rd(),c=rd();add(u,v,w,c);}
    int mf=0,mc=0;
    while(SPFA()<=1e18) {
        int u=T;mf+=flo[T],mc+=flo[T]*d[T];
        while(u!=S) e[pre[u]].w-=flo[T],e[pre[u]^1].w+=flo[T],u=e[pre[u]^1].v;
    }
    cout<<mf<<' '<<mc<<endl;
}
}
bool MED;
signed main() {
    //freopen(".in","r",stdin);freopen(".out","w",stdout);
    for(int tt=1;tt;tt--) SOLVER::MAIN();
    cerr<<(&MBE-&MED)/1024<<" KB, "<<1000*clock()/CLOCKS_PER_SEC<<" ms\n";
    return 0;
}