#include<map>
#include<set>
#include<queue>
#include<deque>
#include<cmath>
#include<ctime>
#include<bitset>
#include<vector>
#include<cstdio>
#include<string>
#include<random>
#include<cassert>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<unordered_map>
using namespace std;
using ll=long long;
using uint=unsigned int;
using ull=unsigned long long;
#define endl '\n'
#define lb lower_bound
#define ub upper_bound
#define eb emplace_back
#define fs fflush(stdout)
#define ump unordered_map
#define pq priority_queue
#define clz __builtin_clz
#define ctz __builtin_ctz
#define sz(x) (int)x.size()
#define np next_permutation
#define clzl __builtin_clzll
#define ctzl __builtin_ctzll
#define ppc __builtin_popcount
#define all(x) x.begin(),x.end()
#define ppcl __builtin_popcountll
#define fpi(x) freopen(x,"r",stdin)
#define fpo(x) freopen(x,"w",stdout)
#define uid uniform_int_distribution
#define urd uniform_real_distribution
#define me(x,y) memset(x,y,sizeof(x))
#define dbg(x) cerr<<"In Line "<<__LINE__<<' '<<#x<<'='<<(x)<<'\n'
#define gc p1==p2&&(p2=(p1=buf)+fread(buf,1,iosiz,stdin),p1==p2)?EOF:*p1++
#define iosiz 1024
char buf[iosiz],*p1=buf,*p2=buf;
template<class T> inline T &re(T &x){
	x=0;int f=1;char ch=gc;
	while(ch<48||ch>57){
		if(ch==45) f=-f;ch=gc;
	}
	while(ch>47&&ch<58) x=(x<<1)+(x<<3)+(ch^48),ch=gc;
	return x*=f;
}
#define mod 998244353
#define inf 0x3f3f3f3f
struct node{
    int to,flow,cost,nxt;
}edge[30005];
int tot=-1,n,head[405],dis[405],ans2;
bool vis[405];
inline void add(int u,int v,int w,int c){
    edge[++tot]={v,w,c,head[u]},head[u]=tot;
    edge[++tot]={u,0,-c,head[v]},head[v]=tot;
}
bool spfa(){
    queue<int> q;me(dis,0x3f),dis[1]=0,q.emplace(1),vis[1]=1;
    while(!q.empty()){
        int f=q.front();q.pop(),vis[f]=0;
        for(int i=head[f];~i;i=edge[i].nxt) if(edge[i].flow&&dis[edge[i].to]>dis[f]+edge[i].cost){
            dis[edge[i].to]=dis[f]+edge[i].cost;if(!vis[edge[i].to]) vis[edge[i].to]=1,q.emplace(edge[i].to);
        }
    }
    return dis[n]^inf;
}
int dfs(int u,int flow){
    if(u==n) return ans2+=dis[n]*flow,flow;
    int res=0;vis[u]=1;
    for(int i=head[u];~i;i=edge[i].nxt) if(dis[edge[i].to]==dis[u]+edge[i].cost&&edge[i].flow&&!vis[edge[i].to]){
        int ret=dfs(edge[i].to,min(flow,edge[i].flow));
        if(!ret){
            dis[edge[i].to]=inf;continue;
        }
        res+=ret,flow-=ret,edge[i].flow-=ret,edge[i^1].flow+=ret;
        if(!flow) return vis[u]=0,res;
    }return vis[u]=0,res;
}
int main(){
    #ifdef CCPSDCGK
    fpi("shuju.txt");
    #endif
    me(head,-1);
    re(n);int m=re(m),ans1=0;
    while(m--){
        int u=re(u),v=re(v),w=re(w),c=re(c);
        add(u,v,w,c);
    }
    while(spfa()) ans1+=dfs(1,2147483647);cout<<ans1<<' '<<ans2;
    return 0;
}