#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int C = 26;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
const int MAXN = 5e5 + 10;
struct dsu_rollback {
  vector<int> par;
  vector<int> sz;
  vector<pair<int, int> > stk;
  dsu_rollback() {}
  dsu_rollback(int n) {
    par.resize(n);
    iota(par.begin(), par.end(), 0);
    sz.resize(n, 1);
  }
  int getPar(int v) {
    while (v != par[v]) v = par[v];
    return v;
  }
  bool unite(int u, int v) {
    v = getPar(v);
    u = getPar(u);
    if (u == v) return false;
    if (sz[v] < sz[u]) swap(u, v);
    sz[v] += sz[u];
    par[u] = v;
    stk.emplace_back(v, u);
    return true;
  }
  void undo() {
    assert(!stk.empty());
    auto [v, u] = stk.back();
    stk.pop_back();
    sz[v] -= sz[u];
    par[u] = u;
  }
} dsu;
int n, m, k, tt;
array<int, 3> qry[MAXN];
int day[MAXN], start[MAXN];
vector<pair<int, int> > vec[MAXN << 2];
void water(int v, int b, int e, int l, int r, int aa, int bb) {
  if (l >= r) return;
  if (l == b && r == e) {
    vec[v].emplace_back(aa, bb);
    return;
  }
  int md = (b + e) >> 1;
  water(v << 1, b, md, l, min(r, md), aa, bb);
  water(v << 1 ^ 1, md, e, max(md, l), r, aa, bb);
}
void go(int v, int b, int e) {
  int now = 0;
  for (auto [aa, bb] : vec[v]) {
    if (dsu.unite(aa, bb)) {
      ++now;
    }
  }
  if (e - b == 1) {
    if (qry[b][0] == 2) {
      int z = qry[b][1];
      cout << dsu.sz[dsu.getPar(z)] << "\n";
    }
  }
  if (e - b > 1) {
    int md = (b + e) >> 1;
    go(v << 1, b, md);
    go(v << 1 ^ 1, md, e);
  }
  while (now--) dsu.undo();
}
void solve() {
  cin >> n >> m >> k;
  for (int i = 0; i < m; i++) {
    cin >> qry[i][0];
    day[i] = tt;
    if (qry[i][0] == 1) {
      cin >> qry[i][1] >> qry[i][2];
      --qry[i][1];
      --qry[i][2];
    } else if (qry[i][0] == 2) {
      cin >> qry[i][1];
      --qry[i][1];
    } else {
      start[++tt] = i;
    }
  }
  dsu = dsu_rollback(n);
  start[++tt] = m;
  for (int i = 0; i < m; i++) {
    if (qry[i][0] == 1) {
      int l = i;
      int r = day[i] + k <= tt ? start[day[i] + k] : m;
      water(1, 0, m, l, r, qry[i][1], qry[i][2]);
    }
  }
  go(1, 0, m);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int te = 1;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
