LabView 对N个人按1到N进行编号，然后按顺序逆时针围成一圈。给定一个数m，从1号开始按逆时针方向数，每数到m，对应的人就从圈中出来，然后继续从下一个人开始数，直到圈中只剩下一个人，试输出出圈人的编号顺序。

有两个文件: 每个文件3百万行 文件每行示例如下: name: A063534 C(n) = H(n) + d(n), where C(n) is Chowla's function A048050, H(n) is the half-totient function A023022 and d(n) is the number of divisors function A000005. stripped: A063534 ,6,8,15,21,33,39,51,57,69,87,93,111,123,129,141,159,177,183,201,213,219,237,249,267,291,303,309,321,327,339,381,393,411,417,447,453,471,489,501,519,537,543,573,579,591,597,633,669,681,687,699,717,723,753, 截止2018.7.31