#include <bits/stdc++.h> using namespace std; struct node{ int next,last; }a[10010]; int main(){ int n,m; cin>>n>>m; int tmp=0,index=1; for(int i=1;i<=n;i++){ a[i].last=(i+n-1)%n; a[i].next=(i+1+n)%n; } while(a[1].next==1){ tmp++; index=a[index].next; if(tmp%m==0) { a[a[index].last].next=a[index].next; a[a[index].next].last=a[index].last; tmp=0; } } }