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