#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, p, k, counter = 0, diff = 0;
  bool found = false;
  int arr[1000];
  cin >> n >> p >> k;
  if (p - k <= 1)
    diff = 1;
  else
    diff = p - k;
  for (int i = diff; i <= p + k; i++) {
    arr[counter] = i;
    counter++;
    if (i == n) {
      found = true;
      break;
    }
  }
  if (diff != 1)
    cout << "<<"
         << " ";
  for (int j = 0; j < counter - 1; j++) {
    if (arr[j] == p)
      cout << '(' << arr[j] << ')' << " ";
    else
      cout << arr[j] << " ";
  }
  if (arr[counter - 1] == p)
    cout << '(' << arr[counter - 1] << ')';
  else
    cout << arr[counter - 1];
  if (found == false)
    cout << " "
         << ">>";
  cout << endl;
  return 0;
}
