Circle Counting

Problem Background

Special for beginners, ^_^

Problem Description

There are $n$ people standing in a circle. Counting starts from the $1$st person; the $m$-th person counted is removed from the circle, then counting restarts from the next person after the removed one, and the $m$-th person counted is removed again, and so on, until all people have been removed. Let the $n$ people be numbered $1,2,\dots,n$. Print the order in which they are removed.

Input Format

$n$ and $m$.

Output Format

The order of removal.

Sample Input 1

4 17

Sample Output 1

1 3 4 2

Constraints

$n\le 100$, $m\le 50$. Time limit 1s, memory limit 1024KiB for each test case.