约瑟夫环问题

n, k = map(int, input().split())
if k < 2 or n < k:
    print('Data Error!')
else:
    ls = list(range(1, n + 1))
    while len(ls) >= k:
        ls = ls[k:] + ls[:k - 1]
    ls.sort()
    print(ls)