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.