#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
int n,k;
cin>>n>>k;//k번째 데이터 제거
queue<int> q;
for(int i=1;i<=n;i++){
q.push(i);
}
int cnt=1;
cout<<"<";
while(!q.empty()){
if(cnt==k){
if(q.size()==n) cout<<q.front()<<",";
else if(q.size()!=1) cout<<" "<<q.front()<<",";
else if(q.size()==1) cout<<" "<<q.front();
q.pop();
cnt=1;
}
else{
int data=q.front();
q.pop();
q.push(data);
cnt++;
}
}
cout<<">";
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8cXVldWU+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpewoJaW50IG4sazsKCWNpbj4+bj4+azsvL2vrsojsp7gg642w7J207YSwIOygnOqxsAoKCXF1ZXVlPGludD4gcTsKCglmb3IoaW50IGk9MTtpPD1uO2krKyl7CgkJcS5wdXNoKGkpOwoJfQoKCWludCBjbnQ9MTsKCgoJY291dDw8IjwiOwoJd2hpbGUoIXEuZW1wdHkoKSl7CgkJaWYoY250PT1rKXsKCQkJaWYocS5zaXplKCk9PW4pIGNvdXQ8PHEuZnJvbnQoKTw8IiwiOwoJCQllbHNlIGlmKHEuc2l6ZSgpIT0xKSBjb3V0PDwiICI8PHEuZnJvbnQoKTw8IiwiOwoJCQllbHNlIGlmKHEuc2l6ZSgpPT0xKSBjb3V0PDwiICI8PHEuZnJvbnQoKTsKCQkJcS5wb3AoKTsKCQkJY250PTE7CgkJfQoKCQllbHNlewoJCQlpbnQgZGF0YT1xLmZyb250KCk7CgkJCXEucG9wKCk7CgkJCXEucHVzaChkYXRhKTsKCQkJY250Kys7CgkJfQoJfQoJY291dDw8Ij4iOwoKfQo=