#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<array>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
const int N=100010;
const int inf=0x7fffffff;
const ll INF=0x7fffffffffffffff;
int n,m,tot,S,T;
int vis[N],pre[N],prp[N],flow[N],head[N];
ll dis[N];
int ent=1;
struct Edge{
	int to,nxt,fl,co;
}e[N<<1];
inline void adde(int x,int y,int w,int c){
	e[++ent]={y,head[x],w,c};head[x]=ent;
	e[++ent]={x,head[y],0,-c};head[y]=ent;
}
int spfa(){
	queue<int>q;
	for(int i=1;i<=n;i++)dis[i]=INF,vis[i]=pre[i]=prp[i]=flow[i]=0;
	dis[S]=0;flow[S]=inf;
	q.push(S);
	while(!q.empty()){
		int x=q.front();q.pop();
		vis[x]=0;
		for(int i=head[x];i;i=e[i].nxt)if(e[i].fl){
			int v=e[i].to,c=e[i].co;
			if(dis[v]>dis[x]+c){
				dis[v]=dis[x]+c;
				prp[v]=x;pre[v]=i;
				flow[v]=min(flow[x],e[i].fl);
				if(!vis[v]){
					vis[v]=1;
					q.push(v);
				}
			}
		}
	}
	return flow[T]>0;
}
void dinic(){
	ll mxfl=0,mnco=0;
	while(spfa()){
		ll f=flow[T];
		mxfl+=flow[T];
		mnco+=flow[T]*dis[T];
		int x=T;
		while(x!=S){
			int p=pre[x];
			e[p].fl-=f;e[p^1].fl+=f;
			x=prp[x];
		}
	}
	cout<<mxfl<<' '<<mnco<<'\n';
}
signed main(){
	#ifdef do_while_true
//		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.out","w",stdout));
	#endif
	read(n,m);
	S=1;T=n;
	for(int i=1;i<=m;i++){
		int u,v,f,c;read(u,v,f,c);
		adde(u,v,f,c);
	}
	dinic();
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}