CF1423H.Virus

In Bubbleland a group of special programming forces gets a top secret job to calculate the number of potentially infected people by a new unknown virus. The state has a population of $n$ people and every day there is new information about new contacts between people. The job of special programming forces is to calculate how many contacts in the last $k$ days a given person had.

The new virus has an incubation period of $k$ days, and after that time people consider as non-infectious. Because the new virus is an extremely dangerous, government mark as suspicious everybody who had direct or indirect contact in the last $k$ days, independently of the order of contacts.

This virus is very strange, and people can't get durable immunity.

You need to help special programming forces to calculate the number of suspicious people for a given person (number of people who had contact with a given person).

There are 3 given inputs on beginning $n$ where $n$ is population, $q$ number of queries, $k$ virus incubation time in days. Each query is one of three types:

1. ($x$, $y$) person $x$ and person $y$ met that day ($x \neq y$).
2. ($z$) return the number of people in contact with $z$, counting himself.
3. The end of the current day moves on to the next day.

在泡泡国（Bubbleland），一支特殊的编程部队接到一项绝密任务：计算一种新型未知病毒可能感染的人数。该国总人口为 $n$ 人，且每天都会新增关于人群之间新接触的信息。这支特殊编程部队的任务是：计算某指定人员在过去 $k$ 天内共与多少人发生过接触。

该新型病毒的潜伏期为 $k$ 天；超过该时限后，感染者即被视为不再具有传染性。由于该病毒极度危险，政府将过去 $k$ 天内与某人发生过直接或间接接触的所有人（无论接触顺序如何）均标记为“可疑人员”。

该病毒非常奇特，感染者无法获得持久免疫力。

你需要协助这支特殊编程部队，计算针对某指定人员 $z$ 的可疑人员总数（即：与 $z$ 发生过接触的所有人员数量，包含 $z$ 自身）。

初始输入共三项：$n$（总人口数）、$q$（查询次数）、$k$（病毒潜伏期，单位：天）。每次查询为以下三种类型之一：

1. ($x$, $y$)：表示当天人员 $x$ 与人员 $y$ 发生了接触（$x \neq y$）；
2. ($z$)：返回与人员 $z$ 发生过接触（含自身）的总人数；
3. 当前日期结束，进入下一天。

The first line of input contains three integers $n$ ($1 \le n\le 10^5$) the number of people in the state, $q$ ($1 \le q\le 5×10^5$) number of queries and $k$ ($1 \le k\le 10^5$) virus incubation time in days.

Each of the next $q$ lines starts with an integer $t$ ($1 \le t\le 3$) the type of the query.

A pair of integers $x$ and $y$ ($1 \le x, y \le n$) follows in the query of the first type ($x \neq y$).

An integer $i$ ($1 \le i\le n$) follows in the query of the second type.

Query of third type does not have the following number.

输入的第一行包含三个整数 $n$（$1 \le n\le 10^5$，表示该州的人数）、$q$（$1 \le q\le 5×10^5$，表示查询次数）和 $k$（$1 \le k\le 10^5$，表示病毒的潜伏期，单位为天）。

接下来的 $q$ 行，每行以一个整数 $t$（$1 \le t\le 3$）开头，表示查询类型。

对于第一类查询，其后跟随一对整数 $x$ 和 $y$（$1 \le x, y \le n$，且 $x \neq y$）。

对于第二类查询，其后跟随一个整数 $i$（$1 \le i\le n$）。

第三类查询之后不跟任何数字。

For the queries of the second type print on a separate line the current number of people in contact with a given person.

对于第二类查询，在单独一行输出与给定人员有接触关系的当前人数。

Pay attention if persons $1$ and $2$ had contact first day and next day persons $1$ and $3$ had contact, for $k$>$1$ number of contacts of person $3$ is $3$(persons:1,2,3).

注意：如果第 1 天人员 $1$ 和 $2$ 发生了接触，而第 2 天人员 $1$ 和 $3$ 发生了接触，则当 $k>1$ 时，人员 $3$ 的接触人数为 $3$（涉及人员：$1$、$2$、$3$）。