from collections import deque

n, k = map(int, input().split())

dq = deque()
for i in range(1, n + 1):
    dq.append(i)

result = []

while dq:
    # k-1번 회전
    for _ in range(k - 1):
        dq.append(dq.popleft())
    
    # k번째 제거
    result.append(dq.popleft())
print(result)