#include <iostream>#include <cstdio>#include <cstring>using namespace std;int n,t,num=0,ans=1;struct node{    int front;    int next;}a[100010];int main(){    scanf("%d%d",&n,&t);    a[1].front=n;a[1].next=2;    a[n].front=n-1;a[n].next=1;    for(int i=2;i<n;i++)        a[i].front=i-1,        a[i].next=i+1;    while(a[ans].front!=ans&&a[ans].next!=ans)//    {        num++;        if(num==t)        {            num=0;            a[a[ans].next].front=a[ans].front;            a[a[ans].front].next=a[ans].next;        }        ans=a[ans].next;    }    printf("%d",ans);    return 0;}