约瑟夫问题是一个经典的问题。已知n个人（不妨分别以编号1，2，3，...，n 代表）围坐在一张圆桌周围，从编号为 k 的人开始，从1开始顺时针报数1, 2, 3, ...，顺时针数到m 的那个人，出列并输出。然后从出列的下一个人开始，从1开始继续顺时针报数，数到m的那个人，出列并输出，...依此重复下去，直到圆桌周围的人全部出列。


输入：n,k,m




输出：按照出列的顺序依次输出出列人的编号，编号中间相隔一个空格,每10个编号为一行。


非法输入的对应输出如下


a)

输入：：n、k、m任一个小于1
输出：n,m,k must bigger than 0.


b)



输入：k>n


输出：k should not bigger than n.



例



输入



9,3,2



输出



4 6 8 1 3 7 2 9 5(The Joseph question is a classic question. Known n individuals (may as well as number 1, 2, 3,..., n representative) sit around a round table, start from people numbered K, and start clockwise from 1 to 1, 2, 3,..., the time needle counts to the m person, out and out. Then from the next on the next person, from 1 to the 1 to continue clockwise, the number to the person, out and output,... Then repeat, until the round table all out of the list.


Input: n, K, M




Output: according to the order of output, the number of the listed people is numbered. The number is separated by one space, and each 10 numbers are one row.


The corresponding output of illegal input is as follows


A)

Input:: n, K, and m are less than 1
Output: n, m, K must bigger than 0.


B)



Input: k>n


Output: K should not bigger than n.



example



input



9,3,2



output



468137295)