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*)
def p(l):

    n = len(l)
    max = 1
    m = 1
    for j in range(1,n):
        if l[j]>=l[j-1]:
            max+=1
        else:
            if max > m:
                m = max
            max = 1
    if max > m:
        m = max
    return m

def f(m):

    if p(m) == len(m):
        print(len(m))
        return True
    else:
        return False

def new_sp_right(pol):
    right = pol[0:round(len(pol) / 2)]
    return right

def new_sp_left(pol):
    left = pol[round(len(pol) / 2):]
    return left


n = int(input())
l = list(map( int, input().split()))

spisok = l

while f(spisok) == False:
    sp1 = new_sp_right(spisok)
    sp2 = new_sp_left(spisok)
    spisok = sp1 if p(sp1) == max(p(sp1),p(sp2)) else sp2




