#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 22;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}

#include<cstring>
struct edge { int to, cap, rev; bool isrev; };
vector<edge> G[1000];
bool used[1000];
void add_edge(int from, int to, int cap) {
	G[from].push_back(edge{ to, cap, (int)G[to].size(),false });
	G[to].push_back(edge{ from, 0, (int)G[from].size() - 1,true });
}
int dfs(int v, int t, int f) {
	if (v == t)return f;
	used[v] = true;
	for (int i = 0; i < (int)G[v].size(); i++) {
		edge& e = G[v][i];
		if (!used[e.to] && e.cap > 0) {
			int d = dfs(e.to, t, min(f, e.cap));
			if (d > 0) {
				e.cap -= d;
				G[e.to][e.rev].cap += d;
				return d;
			}
		}
	}
	return 0;
}
int n, m;
int max_flow(int s, int t, int sup = mod) {
	int flow = 0;
	rep(i, sup) {
		fill(used, used + n, false);
		int f = dfs(s, t, mod);
		if (f == 0)return flow;
		flow += f;
	}
	return flow;
}



bool visited[1000];
int s, t;
void solve() {
	s--; t--;
	rep(i, n) {
		G[i].clear();
	}
	rep(i, m) {
		int a, b; cin >> a >> b; a--; b--;
		add_edge(a, b, 1);
	}
	int f = max_flow(s, t);

	int cnt = 0;
	/*rep(x, n)for (edge e : G[x]) {
		if (!e.isrev && e.cap == 0) {
			cout << x << " " << e.to << "\n";
		}
	}*/
	vector<vector<int>> g(n), rg(n);
	rep(i, n)for (edge e : G[i]) {
		if (e.isrev) {
			if (e.cap) {
				g[i].push_back(e.to);
				rg[e.to].push_back(i);
			}
		}
		else {
			if (e.cap) {
				g[i].push_back(e.to);
				rg[e.to].push_back(i);
			}
		}
	}
	vector<bool> cans(n, false), cant(n, false);
	queue<int> q;
	cans[s] = true; q.push(s);
	while (!q.empty()) {
		int id = q.front(); q.pop();
		for (int to : g[id]) {
			if (!cans[to]) {
				cans[to] = true;
				q.push(to);
			}
		}
	}
	cant[t] = true; q.push(t);
	while (!q.empty()) {
		int id = q.front(); q.pop();
		for (int to : rg[id]) {
			if (!cant[to]) {
				cant[to] = true;
				q.push(to);
			}
		}
	}
	rep(i, n)for (edge e : G[i]) {
		if (!e.isrev && e.cap) {
			if (cans[e.to] && cant[i])cnt++;
		}
	}

	if (cnt==0) {
		cout << f << " " << 0 << "\n";
	}
	else {
		cout << f+1 << " " << cnt << "\n";
	}
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	while (cin >> n >> m >> s >> t, n)
		solve();
	return 0;
}


Measured memory_bytes: 69460