1966 Python

import sys
from collections import deque

n = int(sys.stdin.readline())
for _ in range(n):
    m, t = map(int, sys.stdin.readline().split())
    q = deque(map(int, sys.stdin.readline().split()))
    q.reverse()
    cur_idx = len(q) - t - 1
    res = 1
    h_flag = True
    while True:
        frontQ = q[-1]
        for i in q:
            if i > frontQ:
                q.rotate()
                h_flag = False
                break
        if h_flag:
            if cur_idx == len(q)-1:
                print(res)
                break
            q.pop()
            res += 1
        else:
            if cur_idx < len(q)-1:
                cur_idx += 1
            else:
                cur_idx = 0
            h_flag = True