#include <bits/stdc++.h>
using namespace std;
struct S
{
    int p,q;
}a[10007];
int n,m,cnt = 1;
int main()
{
    cin >> n >> m;
    for (int i = 0;i <= n;i++)
    {
        a[i].p = i - 1;
        a[i].q = i + 1;
    }
    while (a[a[0].q].q != n + 1)
    {
        a[a[cnt].q].p = a[cnt].p;
        a[a[cnt].p].q = a[cnt].q;
        int sum = m;
        while (cnt <= n && sum != 0)
        {
            cnt = a[cnt].q;
            sum--;
        }
        if (cnt > n)
        {
            cnt = a[0].q;
        }
    }
    cout << a[0].q;
    return 0;
}