#include <bits/stdc++.h> using namespace std; int main (){ int n,m; cin >> n >>m; queue<int> l; for(int i = 1;i <= n;i++){ l.push(i); } int b = 0; while(l.size() != 1){ int r = l.front(); l.pop(); b++; if(b == m){ b = 0; }else{ l.push(r); } } cout << l.front(); return 0; }