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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
#include <bits/stdc++.h>

using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return {i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (c it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(x...) " [" #x ": " << (x) << "] "

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
template <typename A, typename B>
using unordered_map2 = __gnu_pbds::gp_hash_table<A, B>;
using namespace __gnu_pbds;
template <typename T> using ordered_set =
  __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag,
                   __gnu_pbds::tree_order_statistics_node_update>;
// ordered_set<int> s; s.insert(1); s.insert(2);
// s.order_of_key(1);    // Out: 0.
// *s.find_by_order(1);  // Out: 2.

using ld = long double;
using ll = long long;

constexpr int mod = 1000 * 1000 * 1000 + 7;
constexpr int odw2 = (mod + 1) / 2;

void OdejmijOd(int& a, int b) { a -= b; if (a < 0) a += mod; }
int Odejmij(int a, int b) { OdejmijOd(a, b); return a; }
void DodajDo(int& a, int b) { a += b; if (a >= mod) a -= mod; }
int Dodaj(int a, int b) { DodajDo(a, b); return a; }
int Mnoz(int a, int b) { return (ll) a * b % mod; }
void MnozDo(int& a, int b) { a = Mnoz(a, b); }
int Pot(int a, ll b) { int res = 1; while (b) { if (b % 2 == 1) MnozDo(res, a); a = Mnoz(a, a); b /= 2; } return res; }
int Odw(int a) { return Pot(a, mod - 2); }
void PodzielDo(int& a, int b) { MnozDo(a, Odw(b)); }
int Podziel(int a, int b) { return Mnoz(a, Odw(b)); }
int Moduluj(ll x) { x %= mod; if (x < 0) x += mod; return x; }

template <typename T> T Maxi(T& a, T b) { return a = max(a, b); }
template <typename T> T Mini(T& a, T b) { return a = min(a, b); }

constexpr int nax = 100 * 1000 + 105;
constexpr int kax = 55;

int n, m, k;
ll wynik[kax];
vector<int> graf[nax * 2];
set<int> dokad;

int skad[nax * 2];
int skad_index[nax * 2];

void Dfs(int v, int w, int idx) {
  if (skad[v] != -1) return;
  skad[v] = w;
  skad_index[v] = idx;
  for (int i = 0; i < (int) graf[v].size(); i++) {
    Dfs(graf[v][i], v, i);
  }
}

void Cofnij(int a, int b) {
  while (b != a) {
    const int v = skad[b];
    const int i = skad_index[b];
    swap(graf[v][i], graf[v].back());
    graf[v].pop_back();
    graf[b].push_back(v);
    b = v;
  }
}

int Przepchnij(int v) {
  for (int i = 0; i <= 2 * n; i++) {
    skad[i] = -1;
  }
  Dfs(v, v, -1);
  for (int i = max(n + k + 1, v + 1); i <= n + n; i++) {
    if (skad[i] != -1) {
      Cofnij(v, i);
      return i - n;
    }
  }
  if (v >= n + k + 1) {
    assert(skad[0] != -1);
    Cofnij(v, 0);
  }
  return -1;
}

void PierwszeK() {
  for (int i = 0; i < k; i++) {
    const int v = Przepchnij(0);
    debug() << "Przepycham od " << 0 << " do " << v;
    if (v < 0) break;
    assert(k + 1 <= v and v <= n);
    dokad.insert(v);
  }
}

void Algos() {
  PierwszeK();
  for (int i = k + 1; i <= n; i++) {
    debug() << imie(i) imie(dokad);
    assert((int) dokad.size() <= k);
    if (!dokad.empty()) {
      assert(*dokad.begin() >= i);
    }
    vector<int> vs(dokad.begin(), dokad.end());
    vs.push_back(n + 1);
    vs.insert(vs.begin(), i);
    assert((int) vs.size() <= k + 2);
    debug() << imie(vs);
    for (int j = 1; j < (int) vs.size(); j++) {
      wynik[j - 1] += vs[j] - vs[j - 1];
    }
    if (!dokad.empty() and *dokad.begin() == i) {
      dokad.erase(i);
      const int v = Przepchnij(n + i);
      debug() << "Przepycham od " << i << " do " << v;
      if (v >= 0) {
        assert(i + 1 <= v and v <= n);
        assert(dokad.find(v) == dokad.end());
        dokad.insert(v);
      }
    }
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> m >> k;
  assert(1 <= n and n <= 100 * 1000);
  assert(1 <= k and k <= 50);
  assert(k < n);
  for (int i = 1; i <= n; i++) {
    if (i <= k) {
      graf[0].push_back(i);
    }
    graf[i].push_back(n + i);
  }
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    assert(1 <= a and a <= n);
    //assert(k + 1 <= b and b <= n);
    if (!(k + 1 <= b and b <= n)) {
      continue;
    }
    graf[n + a].push_back(b);
  }
  Algos();
  for (int i = 0; i <= k; i++) {
    cout << wynik[i] << "\n";
  }
  return 0;
}