You are given two integers n and k. There are n friends labeled from $1$ to $n$ sitting in a circle in increasing order.

Starting from friend $1$, repeat the following process until only one friend remains:

1. Count k friends clockwise, including the current starting friend.

2. The friend you land on leaves the circle.

3. The next round starts from the friend immediately clockwise of the removed friend.

Return the label of the last remaining friend.

Constraints:

• $1 \leq$ k $\leq$ n $\leq 500$

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.