Lights On and Off

Problem Description

Suppose there are $N$ lights ($N$ is a positive integer not greater than $5000$), numbered $1$ to $N$ in order, all initially turned on; and there are $M$ people ($M$ is a positive integer not greater than $N$), also numbered $1$ to $M$ in order.

Person $1$ turns all the lights off. Person $2$ turns on the lights whose numbers are multiples of $2$. Person $3$ flips the lights whose numbers are multiples of $3$ (i.e. turns on the ones that are off, and turns off the ones that are on). In increasing order of number, everyone after that behaves like person $3$: each flips all the lights whose numbers are multiples of their own number.

After person $M$ has finished operating, which lights are off? Output their numbers in increasing order, separated by commas.

Input Format

Two positive integers $N$ and $M$, separated by a single space.

Output Format

Output the numbers of the lights that are off, in order, separated by commas.

Sample Input

10 10

Sample Output

1,4,9

Hint

• A light ends up off if it is flipped an odd number of times. Think about which positions are flipped an odd number of times.
• The output uses a comma , (not a space) to separate the numbers — check against the sample character by character.