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 cut = 1; 
    int x;
    while (q.size() > 1){
        x = q.front();
        q.pop();
        if (cut == m){
            cut = 1;
        }else {
            q.push(x);
            cut++;
        }
    }
    cout << q.front();
    return 0;
}
/*
    先设n,m
    再搞其他的


*/