#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=5e3+5;
const int M=5e4+5;
struct Edge{
int to,w,next,cost;
}edge[M*2];
int head[N],dis[N],pre[N],money[N],vis[N];
int n,m,s,t,cnt,min_cost,max_flow;
void add(int u,int v,int w,int cost){
edge[cnt]={v,w,head[u],cost};
head[u]=cnt++;
}
bool spfa(){//找最短路的增广流
memset(dis,0,sizeof dis);
memset(money,0x3f,sizeof money);
queue<int> q;
q.push(s);
dis[s]=1e18;
money[s]=0;
vis[s]=1;
while(!q.empty()){
int u=q.front();
q.pop();
vis[u]=0;
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].to;
if(money[v]>money[u]+edge[i].cost && edge[i].w){
money[v]=money[u]+edge[i].cost;//最短路
dis[v]=min(dis[u],edge[i].w);//这条最短路的最大流量
pre[v]=i;//前驱边
if(!vis[v]) q.push(v),vis[v]=1;
}
}
}
return dis[t]>0;
}
void EK(){
while(spfa()){
for(int v=t;v!=s;){
int i=pre[v];
edge[i].w-=dis[t];
edge[i^1].w+=dis[t];
v=edge[i^1].to;
}//更新残留网
max_flow+=dis[t];//累加可行流
min_cost+=dis[t]*money[t];//累加费用
}
}
signed main(){
IOS
cin >> n >> m >> s >> t;
memset(head,-1,sizeof head);
for(int i=1;i<=m;i++){
int u,v,w,cost;
cin >> u >> v >> w >> cost;
add(u,v,w,cost);
add(v,u,0,-cost);
}
EK();
cout << max_flow << " " << min_cost << endl;
return 0;
}