def ceiling_division(n, d):
    q, r = divmod(n, d)
    return q + bool(r)
    
def solve(arr):
    stack = []
    minNotInStack =  float("inf");
    for i in arr:
        if(i > minNotInStack):
            continue
        while(len(stack) > 0 and stack[-1] > i ):
            minNotInStack = min(minNotInStack, stack.pop())
        stack.append(i)
    #print(stack)
    return len(arr) - len(stack)
        
        
        
setNum = int(input())
for i in range(setNum):
    probNum, elems = [int(x) for x in input().split()]
    arr = []
    for j in range(ceiling_division(elems, 10)):
        arr += [int(x) for x in input().split()]
    #print(sorted(arr))
    #print(arr)
    print(probNum, solve(arr))