//向量求解約瑟夫環
#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
int main()
{


int n, m;
cin >> n >> m;
vector<int> veci;
for (int i = 1; i <= n;i++)
{
veci.push_back(i);
}
int cnt = 1;
vector<int>::iterator it = veci.begin();


while (!veci.empty())
{
if (cnt == m)
{
cout <<setw(4) << *it << " ";
if (it != veci.end() - 1)
{
it = veci.erase(it);
}
else
{
veci.erase(it);
it = veci.begin();
}
cnt = 0;
}
else
{

it++;
}
cnt++;
if (it==veci.end())
{
it = veci.begin();
}
}
return 0;
}