CF455C Civilization

Andrew plays a game called "Civilization". Dima helps him. The game has $ n $ cities and $ m $ bidirectional roads. The cities are numbered from $ 1 $ to $ n $ . Between any pair of cities there either is a single (unique) path, or there is no path at all. A path is such a sequence of distinct cities $ v_{1},v_{2},...,v_{k} $ , that there is a road between any contiguous cities $ v_{i} $ and $ v_{i+1} $ ( $ 1

The first line contains three integers $ n $ , $ m $ , $ q $ ( $ 1

For each event of the first type print the answer on a separate line.