Josephus problem

In a circle, there are $N$ objects labeled from $1$ to $N$. Starting from the first object, every $k$-th object is eliminated from the circle in turn, and this process continues until only one object remains.

For example, if N = 10 and k = 3, the order of elimination will be: $3$, $6$, $9$, $2$, $7$, $1$, $8$, $5$, $10$. The object labeled $4$ will be the last one remaining.