AT_abc455_d [ABC455D] Card Pile Query

There are $ N $ cards and $ N $ piles of cards. The cards and the piles are numbered $ 1, 2, \ldots, N $ . Initially, pile $ i $ contains only card $ i $ . Perform the following operation for each $ i = 1, 2, \ldots, Q $ in order: - Move card $ C_i $ and all cards stacked on top of card $ C_i $ , preserving their order, on top of card $ P_i $ . It is guaranteed that immediately before performing the operation, cards $ C_i $ and $ P_i $ are in different piles, and card $ P_i $ is on top of some pile. Find the number of cards in each pile after all operations are completed.

The input is given from Standard Input in the following format: > $ N $ $ Q $ $ C_1 $ $ P_1 $ $ C_2 $ $ P_2 $ $ \vdots $ $ C_Q $ $ P_Q $

Let $ A_i $ be the number of cards in pile $ i $ at the end. Output $ A_1, A_2, \ldots, A_N $ in this order, separated by spaces.

### Sample Explanation 1 The sequence of operations proceeds as shown in the figure below.  ### Constraints - $ 1 \leq N, Q \leq 3 \times 10^5 $ - $ 1 \leq C_i, P_i \leq N $ - When the operations are performed in order, immediately before each operation, cards $ C_i $ and $ P_i $ are in different piles. - When the operations are performed in order, immediately before each operation, card $ P_i $ is on top of some pile. - All input values are integers.