#include <bits/stdc++.h>
#define F(i,x,y) for(int i=(x);i<=(y);i++)
#define DF(i,x,y) for(int i=(x);i>=(y);i--)
#define ms(x,y) memset(x,y,sizeof(x))
#define SZ(x) (int)x.size()-1
#define all(x) x.begin(),x.end()
#define pb push_back
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
typedef pair<int,int> pii;
template<typename T> void chkmax(T &x,T y){ x=max(x,y);}
template<typename T> void chkmin(T &x,T y){ x=min(x,y);}
template<typename T> void read(T &FF){
    FF=0;int RR=1;char ch=getchar();
    for(;!isdigit(ch);ch=getchar()) if(ch=='-') RR=-1;
    for(;isdigit(ch);ch=getchar()) FF=(FF<<1)+(FF<<3)+ch-48;
    FF*=RR;
}
const int N=410,M=15010,inf=1e9;
int n,m;
namespace EK{
    int S,T;
    int e[M<<1],ne[M<<1],w[M<<1],f[M<<1],h[N],idx;
    void clr(){ ms(h,-1);idx=0;}
    void add_edge(int x,int y,int z,int c){ e[idx]=y,f[idx]=z,w[idx]=c,ne[idx]=h[x],h[x]=idx++;}
    int incf[N],dis[N],pre[N];
    bool st[N];
    queue<int> Q;
    bool spfa(){
        ms(dis,0x3f),ms(incf,0);
        Q.push(S),dis[S]=0,incf[S]=inf;
        while(!Q.empty()){
            int u=Q.front();Q.pop();
            st[u]=0;
            for(int i=h[u];~i;i=ne[i]){
                int v=e[i];
                if(f[i]&&dis[u]+w[i]<dis[v]){
                    dis[v]=dis[u]+w[i],incf[v]=min(incf[u],f[i]),pre[v]=i;
                    if(!st[v]) Q.push(v);
                }
            }
        }
        return incf[T]>0;
    }
    pii EK(){
        int flow=0,cost=0;
        while(spfa()){
            int t=incf[T];
            flow+=t,cost+=t*dis[T];
            for(int i=T;i!=S;i=e[pre[i]^1]) f[pre[i]]-=t,f[pre[i]^1]+=t;
        }
        return {flow,cost};
    }
};
int main(){
    read(n),read(m);
    EK::clr();
    EK::S=1,EK::T=n;
    F(i,1,m){
        int s,t,c,w;read(s),read(t),read(c),read(w);
        EK::add_edge(s,t,c,w),EK::add_edge(t,s,0,-w);
    }
    auto [flow,cost]=EK::EK();
    printf("%d %d\n",flow,cost);
    return 0;
}