Description

Farmer John and Betsy are playing a game with N (1 <= N <= 30,000)identical cubes labeled 1 through N. They start with N stacks, each containing a single cube. Farmer John asks Betsy to perform P (1<= P <= 100,000) operation. There are two types of operations:
moves and counts.
* In a move operation, Farmer John asks Bessie to move the stack containing cube X on top of the stack containing cube Y.
* In a count operation, Farmer John asks Bessie to count the number of cubes on the stack with cube X that are under the cube X and report that value.

Write a program that can verify the results of the game. 


题目大意：（同银河舰队传说） 对于n块积木，进行两种操作：M a b 把a移到b上，C a 询问a下面有几块积木。

思路：用并查集和tot，sum数组维护，像银河一样简单AC。。。

code：
}