#include<iostream>
using namespace std;
void Josehus(int n, int k);
template<class T>
struct Node
{
T data;
struct Node<T>*next;
};
int main()
{
int n, k;
cin >> n >> k;
Josehus(n, k);
return 0;
}
template<class T>void Josehus(int n, int k)
{
Node<T>*rear = new Node<T>;
Node<T>*front = new Node<T>;
rear->data = 0;
rear->next = front;
front->next = rear;
for (int i = n; i > 0; i--)
{
Node<T>*s = new Node<T>;
s->next = front->next;
s->data = i;
front->next = s;
}
int j = 1;
Node<T>*p = front->next;
while (rear->next != rear)
{
while (j != k - 1)
{
p = p->next;
j++;
}
if (p->next == rear)
{
cout << rear->next->next->data;
Node<T>*q = p->next;
p->next = q->next;
delete q;
}
else if (p->next == rear->next)
{
cout << rear->next->next->data;
Node<T>*q = p->next;
p->next = q->next;
delete q;
}
else
{
cout << p->next->data;
Node<T>*q = p->next;
p->next = q->next;
delete q;
}
}
}