#include <bits/stdc++.h>
using namespace std;
char temp;
void solve() {
  long long int n, p, k;
  cin >> n >> p >> k;
  if (p - k > 1) cout << "<< ";
  long long int z = min(p + k, n);
  for (long long int i = max(p - k, 1LL); i <= z; i++) {
    if (i == p) {
      cout << "(" << i << ") ";
    } else
      cout << i << " ";
  }
  if (p + k < n) cout << ">> ";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  t = 1;
  while (t--) solve();
  return 0;
}
