[백준] 요세푸스 문제0

link

length, remove_point = map(int, input().split())

lst = [i for i in range(1, length+1)]
answer = []
index = 1
while lst:
    if index == remove_point:
        answer.append(lst.pop(0))
        index = 1
        continue
    else:
        index+=1
        lst.append(lst.pop(0))
result = '<'

for w in answer[:-1]:
    result+=f'{w}, '
result += f'{answer[-1]}>'

print(result)