from collections import deque

jobs = [int(job) for job in input().split(', ')]
index = int(input())

cycles = deque()

for i in range(len(jobs)):
    current_job = jobs[i]
    if not cycles and i != index:
        cycles.append(current_job)
        continue
    if i != index and current_job <= jobs[index]:
        if current_job <= cycles[0]:
            cycles.appendleft(current_job)
        elif current_job >= cycles[-1]:
            cycles.append(current_job)
        elif cycles[0] < current_job < cycles[-1]:
            if current_job >= cycles[-1 - 1]:
                biggest = cycles.pop()
                cycles.append(current_job)
                cycles.append(biggest)
            else:
                temp = deque()
                while current_job < cycles[-1]:
                    temp.appendleft(cycles.pop())
                cycles.append(current_job)
                cycles.extend(temp)

cycles.append(jobs[index])
print(sum(cycles))