#include <bits/stdc++.h>
using namespace std;
const int INF = 0xfffffff;
const int maxn = 100001;
queue<int> ans;
bool flag;
void print() {
  if (flag) cout << " ";
  flag = true;
}
int main() {
  int n, p, k;
  cin >> n >> p >> k;
  int q = p - k;
  flag = false;
  if (q < 1) q = 1;
  for (int i = q; i <= p; i++) ans.push(i);
  q = p + k;
  q = min(q, n);
  for (int i = p + 1; i <= q; i++) ans.push(i);
  if (ans.front() != 1) {
    print();
    cout << "<<";
  }
  while (!ans.empty()) {
    print();
    if (ans.front() == p)
      cout << "(" << ans.front() << ")";
    else
      cout << ans.front();
    q = ans.front();
    ans.pop();
  }
  if (q != n) {
    print();
    cout << ">>";
  }
  cout << endl;
}
