B'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 v1, xe2 x80 x89v2, xe2 x80 x89..., xe2 x80 x89vk, that there is a road between any contiguous cities vi and vi xe2 x80 x89+ xe2 x80 x891 (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i xe2 x80 x89< xe2 x80 x89k). The length of the described path equals to (k xe2 x80 x89- xe2 x80 x891). We assume that two cities lie in the same region if and only if, there is a path connecting these two cities. During the game events of two types take place: Dima finds it hard to execute Andrew 's queries, so he asks you to help him. Help Dima. The first line contains three integers n, m, q (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x893 xc2 xb7105; 0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89m xe2 x80 x89< xe2 x80 x89n; 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89q xe2 x80 x89 xe2 x89 xa4 xe2 x80 x893 xc2 xb7105) -- the number of cities, the number of the roads we already have and the number of queries, correspondingly. Each of the following m lines contains two integers, ai and bi (ai xe2 x80 x89 xe2 x89 xa0 xe2 x80 x89bi; 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai, xe2 x80 x89bi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n). These numbers represent the road between cities ai and bi. There can be at most one road between two cities. Each of the following q lines contains one of the two events in the following format: For each event of the first type print the answer on a separate line.'...