#define poj
#define zcz
#ifdef poj
//C++
#include<iomanip>
#include<iostream>
//C
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
//STL
#include<algorithm>
#include<bitset>
#include<functional>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<vector>
//C++11
#if __cplusplus>=201103L
#include<chrono>
#include<random>
#include<unordered_set>
#include<unordered_map>
#endif
#else
#include<bits/stdc++.h>
#endif
using namespace std;
#ifdef zcz
class fastin{
	private:
#ifdef poj
	static const int MAXBF=1<<20;
#else
	const int MAXBF=1<<27;
#endif
	FILE *inf;
	char *inbuf,*inst,*ined;
	inline char _getchar(){
		if(inst==ined)inst=inbuf,ined=inbuf+fread(inbuf,1,MAXBF,inf);
		return inst==ined?EOF:*inst++;
	}
	public:
	fastin(FILE*_inf=stdin){
		inbuf=new char[MAXBF],inf=_inf,inst=inbuf,ined=inbuf;
	}
	~fastin(){delete inbuf;}
	template<typename Int> fastin&operator>>(Int &n){
		static char c;
		Int t=1;
		while((c=_getchar())<'0'||c>'9')if(c=='-')t=-1;
		n=(c^48);
		while((c=_getchar())>='0'&&c<='9')n=(n<<3)+(n<<1)+(c^48);
		n*=t;
		return *this;
	}
	fastin&operator>>(char*s){
		int t=0;
		static char c;
		while((c=_getchar())==' '||c=='\n');
		s[t++]=c;
		while((c=_getchar())>='!'&&c<='~')s[t++]=c;
		s[t]='\0';
		return *this;
	}
}fi;
class fastout{
	private:
#ifdef poj
	static const int MAXBF=1<<20;
#else
	const int MAXBF=1<<27;
#endif
	FILE *ouf;
	char *oubuf,*oust,*oued;
	inline void _flush(){fwrite(oubuf,1,oued-oust,ouf);oued=oust;}
	inline void _putchar(char c){
		if(oued==oust+MAXBF)_flush(),oued=oubuf;
		*oued++=c;
		#ifdef local
		_flush();
		#endif
	}
	public:
	fastout(FILE*_ouf=stdout){
		oubuf=new char[MAXBF],ouf=_ouf,oust=oubuf,oued=oubuf;
	}
	~fastout(){_flush();delete oubuf;}
	template<typename Int> fastout&operator<<(Int n){
		if(n<0)_putchar('-'),n=-n;
		static char S[20];
		int t=0;
		do{S[t++]='0'+n%10,n/=10;}while(n);
		for(int i=0;i<t;++i)_putchar(S[t-i-1]);
		return *this;
	}
	fastout&operator<<(char c){_putchar(c);return *this;}
	fastout&operator<<(char*s){
		for(int i=0;s[i];++i)_putchar(s[i]);
		return *this;
	}
	fastout&operator<<(const char*s){
		for(int i=0;s[i];++i)_putchar(s[i]);
		return *this;
	}
}fo;
#define cin fi
#define cout fo
#else
#define czc ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#endif
#define mod 1000000007
#define ll long long
#define isinf 0x3f3f3f3f
#define ilinf 0x7fffffff
#define lsinf 0x3f3f3f3f3f3f3f3f
#define llinf 0x7fffffffffffffff
#define pii pair<int,int>
#define fr first
#define sc second
#define next ___
#define pb push_back
#define N 5010
#define M 100010
#define For(i,a,b) for(int i=(a);i<=(b);++i)
int n,m,ttt[N],r[N],s,t,ans,next[M],to[M],w[M],p[M],tot=1,h[N],c[N],cur[N],dis[N],vis[N],re[N],d[N];
void add(int x,int y,int z,int v){
//	cout<<x<<' '<<y<<' '<<z<<' '<<v<<'\n';
	to[++tot]=y;next[tot]=h[x];w[tot]=z;p[tot]=v;h[x]=tot;
	to[++tot]=x;next[tot]=h[y];w[tot]=0;p[tot]=-v;h[y]=tot;
	return;
}
int bfs(){
	fill(c,c+n+1,isinf);fill(dis,dis+n+1,isinf);fill(vis,vis+n+1,0);
	for(int i=1;i<=n;++i)cur[i]=h[i];
	queue<int>q;q.push(s);dis[s]=0;
	while(q.size()){
		int x=q.front();q.pop();vis[x]=0;
		for(int i=h[x];i;i=next[i]){
			int y=to[i],z=w[i],va=p[i];
			if(dis[y]>dis[x]+va&&z){
				dis[y]=dis[x]+va;re[y]=i;
				c[y]=min(c[x],z);
				if(!vis[y])vis[y]=1,q.push(y);
			}
		}
	}
	fill(vis,vis+t+1,0);
	return c[t]!=isinf;
}
int dfs(int x,int v){
	if(x==t||!v)return v;
	int tem=v;vis[x]=1;
	for(int i=cur[x];i;i=next[i]){
		cur[x]=i;
		int y=to[i],z=w[i];
		if(vis[y]||dis[y]!=dis[x]+p[i])continue;
		int vt=dfs(y,min(tem,z));
		if(!vt)continue;
		w[i]-=vt;w[i^1]+=vt;
		tem-=vt;ans+=vt*p[i];
		if(tem==0)break;
	}
	vis[x]=0;
	return v-tem;
}
void solve(){
	cin>>n>>m>>s>>t;
	For(i,1,m){
		int u,v,w,p;
		cin>>u>>v>>w>>p;
		add(u,v,w,p);
	}
	int y=0;
	while(bfs())y+=dfs(s,isinf);
	cout<<y<<' '<<ans<<'\n';
	return;
}
int main(){
	#ifndef zcz
	czc;
	#endif
	int t=1;
	while(t--)solve();
	return 0;
}