设有n个人围坐在圆桌周围，从某个位置开始用自然数进行编号为1，2，…，n。然后从编号为k的人从1开始报数，数到m的人便出列；下一个人(第m十1个)又从1开始报数，数到m的人便是第二个出列的人。如此继续下去，直到最后一个人出列为止。要求输出这个出列的顺序。

这个问题称为雅瑟夫(Josephu)问题。-Sitting at round tables with n individuals around started from a position of the number of natural numbers 1,2, ..., n. K, from the number reported from a starting number, the number of people to have a column m　the next person (the first ten 1 m) and from a start reporting the number of people who count m is out of the second out of people. So continue, until the last one out of the line up. Requirements of the order of the columns of this output. This problem is called Ya Sefu (Josephu) problem.