Baekjoon #1158

#include<bits/stdc++.h>

using namespace std;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N, K; cin >> N >> K;
    queue<int> Q;
    for(int i=1;i<=N;i++) Q.push(i);
    cout << "<";
    while(true) {
        for(int i=1;i<K;i++) {
            Q.push(Q.front());
            Q.pop();
        }
        cout << Q.front(); Q.pop();
        if(!Q.empty()) cout << ", ";
        else break;
    }
    cout << ">";

    return 0;
}

import java.util.*;
import java.io.*;

public class Main {

	public static void main(String[] args)throws IOException{
		FastReader input = new FastReader();
		
		int N = input.nextInt();
		int K = input.nextInt();
		
		StringBuilder sb = new StringBuilder();
		sb.append("<");
		
		Queue<Integer> queue = new ArrayDeque<>();
		for(int i=1; i<N+1; i++) { // 초기값
			queue.add(i);
		}
		
		while(queue.size()!=1) {
			for(int i=0; i<K-1; i++) { // K-1번째까지 poll하지 않고 넘어감
				int temp = queue.poll();
				queue.add(temp);
			}
			sb.append(queue.poll() + ", "); // K번째는 poll
		}
		sb.append(queue.poll()+">");
		
		System.out.println(sb);
	}
	
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() throws IOException{
        	br = new BufferedReader(new InputStreamReader(System.in)); //백준 제출 시 주석해제를 하면 됩니다.
        	// br = new BufferedReader(new FileReader("input.txt")); //IDE 실행 시 주석해제를 하면 됩니다.
        }

        String next() {
            while(st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() { return Integer.parseInt(next()); }
        long nextLong() { return Long.parseLong(next()); }
        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}

import sys
from collections import deque

def input():
    return sys.stdin.readline().rstrip()

N, K = map(int, input().split())
_list = []
q = deque([i + 1 for i in range(N)])

while len(q) != 0:
    q.rotate(-K)
    _list.append(q.pop())

print('<' + ', '.join(map(str, _list)) + '>')