代码如下

#include <iostream>
using namespace std;
int m,n;int j=0,k=0;
int main()
{
    cin >> m >> n;
    int p[m+5],t=m;
    for(int i = 0;i<m;i++) p[i] = 1;
    
    while(t > 0){
        if(p[j] != 0){
            k++;
            if(k == n){
                cout << j+1 << endl;
                p[j] = 0;
                k = 0;
                t--;
            }
        }
        j++;
        if(j == m) j = 0;
    }
	return 0;
}