Introduction - If you have any usage issues, please Google them yourself
Joseph issues numbered 1,2,3, ..., n of the n individuals in accordance with the direction of the order of the needle sitting next to a round-table, each person holding the hands of a password (positive integer). First of all, enter a positive integer as the number of upper limit at m, then started from the first order since the direction of the needle 1 at the beginning of the order of the number of people who report to leave the table m, and in his hand and password as the new value of m, from needle under the direction of the order of a person sitting at the table began to count off from 1, and so on, until all leave the table until everyone.