백준 11866번 - 요세푸스 문제 0

n, k = map(int, input().split())
arr = [i+1 for i in range(n)]
ans = []

while len(arr) > 1:
  for _ in range(k-1):
    arr = arr[1:] + [arr[0]]
  ans.append(arr.pop(0))

ans.append(arr.pop())

print('<', end='')
print(*ans, sep=', ', end='')
print('>')

n, k = map(int, input().split())
arr = [i+1 for i in range(n)]
ans = []

i = 0

while len(arr) > 0:
  i = (i+k-1) % len(arr)
  ans.append(arr.pop(i))

print('<', end='')
print(*ans, sep=', ', end='')
print('>')