python

N=1e5+10
a=[0]*110000
p=input().split()
n=int(p[0])
m=int(p[1])
c=0
k=0
now=0
while(c!=(n-1)):
    now=(now+1)%n
    while(a[now]!=0):
        now=(now+1)%n
    k+=1;
    #print(k,end=" ")
    if(k==m):
        if(now==0):
            print(n,end=" ")
        else:
            print(now,end=" ")
        a[now]=1
        k=0
        c+=1
print()
ans=-1
for i in range(n):
    if(a[i]==0):
        ans=i
        break
if(ans==0):
    ans=n
print(ans)