You are given an integer array order of length $n$, representing the finishing order of $n$ participants labeled from $1$ to $n$. You are also given an integer array friends containing the labels of a subset of these participants.

Return an array representing the finishing order of your friends, preserving their relative positions as they appear in order.

Constraints:

• $1 \leq n ==$ order.length $\leq 100$

• order contains every integer from $1$ to $n$ exactly once

• $1 \leq$ friends.length $\leq \min(8, n)$

• $1 \leq$ friends[i] $\leq n$

• friends is strictly increasing

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.