#include <iostream>
#include <queue>
using namespace std;
int main() {
    int n, m;
	cin >> n >> m;
    queue<int> q;
    for (int i = 1; i <= n; i ++) {
        q.push(i);
    }
    int cur = 1;
    while (q.size() > 1) {
        int x = q.front();
        q.pop();
        if (cur == m) {
            cur = 1;
        } else {
            q.push(x);
            cur++;
        }
    }
    cout << q.front() << endl;
    return 0;
}