1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
#include <bits/stdc++.h>


using namespace std;


vector <long long> solve(int n, int k, vector <vector<int>> &g) {
    const int SINK = 2 * n;
    vector <long long> ans(k + 1, 0);

    for (int targetFlow = 0; targetFlow <= k; targetFlow++) {
        int l, r, currFlow = 0;
        vector <int> in(2 * n, -1), out(2 * n, -1), vis(2 * n, false);

        function <bool(int)> tryPush = [&](int v) {
            if (vis[v]) {
                return false;
            }

            vis[v] = true;
            if (n <= v && v <= n + k - 1) {
                if (out[v] == -1) {
                    out[v] = SINK;
                    return true;
                }
            }

            for (int u : g[v]) if (u != out[v] && tryPush(u)) {
                out[v] = u;
                in[u] = v;
                return true;
            }

            if (in[v] != -1) {
                int u = in[v];
                out[u] = in[v] = -1;

                if (tryPush(u)) {
                    return true;
                } else {
                    out[u] = v;
                    in[v] = u;
                }
            }

            return false;
        };

        function <void(int)> retractFlow = [&](int v) {
            if (v == SINK) {
                return ;
            }

            retractFlow(out[v]);
            out[v] = in[v] = -1;
        };

        l = r = k;
        deque <int> unmatched = {l};

        bool retracted = true;
        for (; l < n; l++) {
            if (retracted) {
                fill(vis.begin(), vis.end(), false);

                vector <int> toAdd;
                while (!unmatched.empty()) {
                    int v = unmatched.front();
                    unmatched.pop_front();

                    if (v >= l && v <= r && (out[v] == -1 || in[v] != -1)) {
                        if (tryPush(v)) {
                            currFlow++;
                            break;
                        } else {
                            toAdd.push_back(v);
                        }
                    }
                }

                for (int v : toAdd) {
                    unmatched.push_back(v);
                }
            }

            retracted = false;
            while (r < n && currFlow <= targetFlow) {
                r++;

                if (out[r] == -1 || in[r] != -1) {
                    fill(vis.begin(), vis.end(), false);

                    if (tryPush(r)) {
                        currFlow++;
                    } else {
                        unmatched.push_back(r);
                    }
                }
            }

            ans[currFlow] += n - r;

            retracted = in[l] == -1 && out[l] != -1;
            if (retracted) {
                retractFlow(l);
                currFlow--;
            }
        }
    }

    ans[0] = (long long) (n - k) * (n - k + 1) / 2;
    for (int i = 0; i < k; i++) {
        ans[i] -= ans[i + 1];
    }

    return ans;
}

int main() {
    ios_base::sync_with_stdio(false);

    int n, m, k;
    cin >> n >> m >> k;

    vector <vector<int>> g(2 * n);
    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v; u--; v--;

        g[n + v].push_back(u);
    }

    for (int v = 0; v < n; v++) {
        g[v].push_back(n + v);
    }

    auto ans = solve(n, k, g);
    for (long long &x : ans) {
        cout << x << '\n';
    }

    return 0;
}