#include<stdio.h>
#include<stdlib.h>
//约瑟夫环问题 -- 围成圈报数(n个人围成一个圈,从第一个人开始报数,报到m的出去,求最后那个人)
typedef struct Ring{
int N;
struct Ring * Node;
}ring;
void pop(ring * r,ring * r2){
r->Node = r2->Node;
}
int main(){
ring * rings = malloc(sizeof(ring *));
rings->N = 1;
ring * first = rings;
int n,m,i;
scanf("%d%d",&n,&m);
for(i=2;i<=n;i++){
ring * rg = malloc(sizeof(ring *));
rg->N = i;
rg->Node = NULL;
first->Node = rg;
first = rg;
}
first->Node = rings;
ring *flag = rings;
i=1;
while(flag->Node!=flag){
if(i==m-1){
pop(flag,flag->Node);
i=0;
}
rings = rings->Node;
flag = rings;
i++;
}
printf("%d",flag->N);
return 0;
}