#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct {
    int personIdx;
    int tickets;
} QueueItem;

int solution(int* tickets, int ticketsSize, int k) {
    QueueItem* queue = (QueueItem*)malloc(ticketsSize * 100 * sizeof(QueueItem));
    int front = 0, rear = 0;
    
    for (int i = 0; i < ticketsSize; i++) {
        queue[rear].personIdx = i;
        queue[rear].tickets = tickets[i];
        rear++;
    }
    
    int time = 0;
    while (front < rear) {
        QueueItem current = queue[front];
        front++;
        time++;
        current.tickets--;
        
        if (current.personIdx == k && current.tickets == 0) {
            free(queue);
            return time;
        }
        
        if (current.tickets > 0) {
            queue[rear] = current;
            rear++;
        }
    }
    
    free(queue);
    return time;
}

int main() {
    char line[1000];
    fgets(line, sizeof(line), stdin);
    
    int tickets[100];
    int size = 0;
    char* token = strtok(line + 1, ",]");
    while (token != NULL) {
        tickets[size++] = atoi(token);
        token = strtok(NULL, ",]");
    }
    
    int k;
    scanf("%d", &k);
    
    int result = solution(tickets, size, k);
    printf("%d\n", result);
    
    return 0;
}