#include <bits/stdc++.h>

#define lll __int128
#define el '\n'
#define sz(x) x.size()
using namespace std;
using ll = long long;
using ull = unsigned long long;

vector<vector<int>> adj, adj2;
vector<int> lvl;
int const N = 5e3;
bitset<N> bt[N];
vector<int> num(N + 1), szz(N + 1), vis(N + 1), par(N + 1);
void bfs(queue<int> &q, int n) {
    for (int i = 0; i < n; i++)bt[i][i] = 1;
    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (auto child: adj[node]) {
            bt[child] |= bt[node];
            if (num[child] == 1) {
                lvl[child] = max(lvl[child] , lvl[node] + 1);
                q.push(child);
            }
            num[child]--;
        }
    }

}

void dfs(int node, int pr) {
    vis[node] = 1;
    szz[pr]++;
    par[node] = pr;
    for (auto child: adj2[node]) {
        if (vis[child])continue;
        dfs(child, pr);
    }
}

long long solverange(int mid, int n) {
    long long ans = 0;
    vector<vector<int>> freq(n + 1, vector<int>(n + 1));
    for (int i = 0; i < n; i++) {
        freq[par[i]][lvl[i]]++;
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (j)freq[i][j] += freq[i][j - 1];
        }
    }
    for (int i = 0; i < n; i++) {
        int rem = mid - (n - szz[par[i]]);
        if (freq[par[i]][lvl[i]] <= rem)ans++;
    }
    return ans;
}

int solveD(int r, int n) {
    int ans = 0;
    for (int i = 0; i < n; i++) {
        if (bt[i].count() > r)ans++;
    }
    return ans;
}

void tc() {
    int l, r, n, m;
    cin >> l >> r >> n >> m;
    adj = vector<vector<int>>(n + 1);
    adj2 = vector<vector<int>>(n + 1);
    lvl = vector<int>(n + 1);
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj2[u].push_back(v);
        adj2[v].push_back(u);
        num[v]++;
    }
    queue<int> q;
    for (int i = 0; i < n; i++) {
        if (!num[i]) q.push(i);
    }
    bfs(q, n);
    for (int i = 0; i < n; i++) {
        if (!vis[i])dfs(i, i);
    }
    cout << solverange(l, n) << el << solverange(r, n) << el << solveD(r, n) << '\n';
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    tc();
}