https://vjudge.net/problem/UVA-130
https://www.cnblogs.com/devymex/archive/2010/09/04/1813034.html
#include<cstdio>
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n,k;
while(scanf("%d%d",&n,&k),n&&k){
vector<int> v;
for(int i=0;i<n;v.push_back(++i));
for(int m=(k-1)%v.size(),t;v.size()!=1;){
t=(m+k-1)%(v.size()-1);
if(t>=m)t=(t+1)%v.size();
v[m]=v[t];
v.erase(v.begin()+t);
m=(m+k-(t<m))%v.size();
}
cout<<(n-v.front()+1)%n+1<<endl;
}
}