백준 1966번 - 프린터 큐

for _ in range(int(input())):
  n, i = map(int, input().split())
  queue = list(map(int, input().split()))
  count = 0
  while queue:
    i -= 1
    if max(queue) == (out:=queue.pop(0)):
      count += 1
      if i < 0:
        print(count)
        break
    else:
      queue.append(out)
      if i < 0:
        i = len(queue) -1

for _ in range(int(input())):
    n,m=map(int,input().split())
    t=list(map(int,input().split()))
    a=sorted(t, reverse=True);j=0
    i=0
    while True:
        if a[j] == t[i]:
            j+=1
            if i == m:
                print(j)
                break
        i=(i+1)%n