#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first 
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 5047;
VI g[N];
VI gr[N];
bool used[N];

int dfs1(int v)
{
	used[v] = 1;
	int cnt = 1;
	for (auto to : g[v])
		if (!used[to])
			cnt += dfs1(to);
	return cnt;
}

int dfs2(int v)
{
	used[v] = 1;
	int cnt = 1;
	for (auto to : gr[v])
		if (!used[to])
			cnt += dfs2(to);
	return cnt;
	
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int a, b, n, m;
	cin >> a >> b >> n >> m;
	FOR (i, 0, m)
	{
		int u, v;
		cin >> u >> v;
		g[u].PB(v);
		gr[v].PB(u);
	}
	VI ans(3);
	FOR (i, 0, n)
	{
		fill(used, used + n, false);
		int cnt = dfs1(i);
		if (n - cnt < a)
			ans[0]++;
		if (n - cnt < b)
			ans[1]++;
		fill(used, used + n, false);
		cnt = dfs2(i);
		if (cnt > b)
			ans[2]++;
	}
	cout << ans[0] << '\n' << ans[1] << '\n' << ans[2] << '\n';
	
	return 0;
}