User ainta is making a web site. This time he is going to make a navigation of the pages. In his site, there are *n* pages numbered by integers from 1 to *n*. Assume that somebody is on the *p*-th page now. The navigation will look like this:

When someone clicks the button "&lt;&lt;" he is redirected to page 1, and when someone clicks the button "&gt;&gt;" he is redirected to page *n*. Of course if someone clicks on a number, he is redirected to the corresponding page.

There are some conditions in the navigation:
 -  If page 1 is in the navigation, the button "&lt;&lt;" must not be printed. -  If page *n* is in the navigation, the button "&gt;&gt;" must not be printed. -  If the page number is smaller than 1 or greater than *n*, it must not be printed. 
You can see some examples of the navigations. Make a program that prints the navigation.
The first and the only line contains three integers *n*, *p*, *k* (3 ≤ *n* ≤ 100; 1 ≤ *p* ≤ *n*; 1 ≤ *k* ≤ *n*)
#! /usr/bin/python

def sol():
  n, p, k = map(int, input().split())

  outstring = ""
  has_one = False
  has_n = False
  prefix = ""
  for i in range(p-k, p+k+1):
    if i == 1:
      has_one = True
    if i == n:
      has_n = True
    if i < 1 or i > p+k:
      continue
    else:
      if i == p:
        outstring += prefix + "({})".format(str(i))
      else:
        outstring += prefix + str(i)
      prefix = " "
  
  if not has_one:
    outstring = "<< " + outstring
  if not has_n:
    outstring += " >>"

  print(outstring)

sol()