[백준] 11866번 요세푸스 문제 O 문제! (silver 5

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;
public class Main{

	public static void main(String[] args) throws IOException {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out));
		StringTokenizer st=new StringTokenizer(br.readLine());
		ArrayList<Integer> arr=new ArrayList<>();
		StringBuilder sb=new StringBuilder();
		int n=Integer.parseInt(st.nextToken());
		arr.add(0);
		for(int i=1; i<=n; i++) {
			arr.add(i);
		}
		int k=Integer.parseInt(st.nextToken());
		int index=k;
		sb.append("<");
		while(true) {
			sb.append(arr.get(index));
			arr.remove(index);
			if(arr.size()==1) {
				sb.append(">");
				break;
			}
			sb.append(", ");
			index+=k-1;
			while(true) {
				if(index>arr.size()-1) {
					index-=(arr.size()-1);
				}
				else {
					break;
				}
			}
		}
		bw.write(sb.toString());
		bw.flush();
	}
}