"""
출처:프로그래머스,
https://school.programmers.co.kr/learn/courses/30/lessons/42587
"""

# 풀이 과정
# 숫자가 클수록 우선순위가 높다!
from collections import deque


def solution(priorities, location):
    result = 0  # 실행 순서

    p = deque(priorities)

    l = location

    finish_num = p[l]

    p[l] = 0

    while True:
        q = p.popleft()

        if q == 0:

            if len(p) == 0:
                return result + 1

            else:
                if finish_num >= max(p):
                    return result + 1
                else:
                    p.append(q)

        else:
            if q >= max(p) and q >= finish_num:
                result += 1
            else:
                p.append(q)