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/env python3
# -*- coding: utf-8 -*-

"""
http://codeforces.com/contest/399/problem/A
A. Pages
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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:

<< p - k p - k + 1 ... p - 1 (p) p + 1 ... p + k - 1 p + k >>
When someone clicks the button "<<" he is redirected to page 1, and when someone clicks the button ">>" 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 "<<" must not be printed.
If page n is in the navigation, the button ">>" 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.

Input
The first and the only line contains three integers n, p, k (3 ≤ n ≤ 100; 1 ≤ p ≤ n; 1 ≤ k ≤ n)

Output
Print the proper navigation. Follow the format of the output from the test samples.

Examples
inputCopy
17 5 2
outputCopy
<< 3 4 (5) 6 7 >> 
inputCopy
6 5 2
outputCopy
<< 3 4 (5) 6 
inputCopy
6 1 2
outputCopy
(1) 2 3 >> 
inputCopy
6 2 2
outputCopy
1 (2) 3 4 >>
inputCopy
9 6 3
outputCopy
<< 3 4 5 (6) 7 8 9
inputCopy
10 6 3
outputCopy
<< 3 4 5 (6) 7 8 9 >>
inputCopy
8 5 4
outputCopy
1 2 3 4 (5) 6 7 8 



"""

n, p, k = map(int, input().split(' '))

s = '({})'.format(str(p))

for i in range(1, k + 1):
    if p - i > 0:
        s = str(p - i) + ' ' + s
    if p + i <= n:
        s += ' ' + str(p + i)

if s[0] != '(' and int(s.split(' ')[0]) > 1:
    s = '<< ' + s
if s[-1] != ')' and int(s.split(' ')[-1]) < n:
    s += ' >>'

print(s)
