#include <iostream>
#include <queue>
using namespace std;
using std::cout;
using std::cin;
int main() {
int n, k;
cin >> n;
cin >> k;
int count = 1;
queue <int> qu;
for (int i = 1; i <= n; i++) qu.push(i);
cout << "<";
while (qu.size()) {
if (count <= k - 1) {
qu.push(qu.front());
qu.pop();
}
count++;
if (count == k) {
if (qu.size() != 1)
cout << qu.front() << ", ";
else cout << qu.front() << ">";
qu.pop();
count = 1;
}
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8cXVldWU+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwp1c2luZyBzdGQ6OmNvdXQ7CnVzaW5nIHN0ZDo6Y2luOwoKaW50IG1haW4oKSB7CgoJaW50IG4sIGs7CgljaW4gPj4gbjsKCWNpbiA+PiBrOwoJaW50IGNvdW50ID0gMTsKCXF1ZXVlIDxpbnQ+IHF1OwoKCWZvciAoaW50IGkgPSAxOyBpIDw9IG47IGkrKykgcXUucHVzaChpKTsKCWNvdXQgPDwgIjwiOwoJd2hpbGUgKHF1LnNpemUoKSkgewoJCWlmIChjb3VudCA8PSBrIC0gMSkgewoJCQlxdS5wdXNoKHF1LmZyb250KCkpOwoJCQlxdS5wb3AoKTsKCQl9CgkJY291bnQrKzsKCQlpZiAoY291bnQgPT0gaykgewoJCQlpZiAocXUuc2l6ZSgpICE9IDEpCgkJCQljb3V0IDw8IHF1LmZyb250KCkgPDwgIiwgIjsKCQkJZWxzZSBjb3V0IDw8IHF1LmZyb250KCkgPDwgIj4iOwoJCQlxdS5wb3AoKTsKCQkJY291bnQgPSAxOwoJCX0KCX0KCglyZXR1cm4gMDsKfQ==