#P3429. Josephus Problem II

Josephus Problem II

当前没有测试数据。

Description

Consider a game where there are n children (numbered 1,2,,n) in a circle. During the game, repeatedly k children are skipped and one child is removed from the circle. In which order will the children be removed?

Input Format

The only input line has two integers n and k.

Output Format

Print n integers: the removal order.
7 2
3 6 2 7 5 1 4

Hint

<li> 1n2105 </li> <li> 0k109 </li>

Source

CSES