BOJ11866 요세푸스 문제 0

from collections import deque

N, K = map(int, input().split())
elem = [str(i+1) for i in range(N)]

if K == 1:
	print('<' + ', '.join(elem) + '>')
else:
	dq = deque(elem)
	arr = []
	while dq:
		
		for i in range(K-1):
			dq.append(dq.popleft())
		arr.append(dq.popleft())
		
	ans = '<'+', '.join(arr)+'>'
	print(ans)