[백준 1966] 프린터 큐- Python

from collections import deque
import sys
input = sys.stdin.readline
testcase = int(input())
result = list()
for _ in range(testcase):
    n,m = map(int,input().split())
    queue = deque(map(int,input().split()))
    idx = deque(i for i in range(n))
    cnt = 0
    max_num = max(queue)
    while True:
        first = queue.popleft()
        first_idx = idx.popleft()
        if first_idx == m and first==max_num:
            cnt+=1
            result.append(cnt)
            break
        elif first == max_num:
            cnt +=1
            max_num = max(queue)
        else:
            queue.append(first)
            idx.append(first_idx)
for i in result:
    print(i)