You are given a $0$ indexed integer array nums representing the initial positions of several marbles. You are also given two $0$ indexed integer arrays moveFrom and moveTo of equal length.

Across moveFrom.length steps, you relocate the marbles. On the $i^{ ext{th}}$ step, you move all marbles situated at position moveFrom[i] to position moveTo[i].

Return the sorted list of unique positions that contain at least one marble after completing all moves.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ moveFrom.length $\leq 10^5$

• moveFrom.length $==$ moveTo.length

• $1 \leq$ nums[i], moveFrom[i], moveTo[i] $\leq 10^9$

• The test cases are generated such that there is at least one marble at moveFrom[i] when applying the $i^{ ext{th}}$ move.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.