1 1 9 1 1 1
0

5

from collections import deque
prior = list(map(int, input().split()))
target = int(input())
q = deque(enumerate(prior))
order = 0
while q:
    idx, p = q.popleft()
    if any(x[1] > p for x in q):
        q.append((idx, p))
    else:
        order += 1
        if idx == target:
            print(order)
            break