def ceiling_division(n, d):
    q, r = divmod(n, d)
    return q + bool(r)
    
def solve(arr):
    newArr = sorted(arr[:])
    idx, newidx = 0,0
    
    while idx < len(arr) and newidx < len(newArr):
        print(arr[idx], " ", newArr[newidx])
        if arr[idx] == newArr[newidx]:
            idx+=1 
            newidx+=1 
        else: # arr[idx] < newArr[newidx]:
            idx += 1
    return len(newArr) - newidx
            
        
        
        
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(solve(arr))