fac = [1 for i in range(51)]
for i in range(1, 51): fac[i] = fac[i] * fac[i - 1]
def binom(a, b):
    if b < 0: return 0
    return fac[a] // fac[b] // fac[a - b]

def solve():
    n, k = map(int, input().split())
    a = list(map(int, input().split()))

    if n & 1:
        print(n, n - k)
        b = []
        for i in range(1, n + 1):
            if not i in a:
                b.append(i)
        print(" ".join(list(map(str, b))))
        return

    tot = 0
    for i in range(k & 1, k, 2):
        tot += binom(n, i)
    
    cnt = 0
    for i in range(1, n + 1):
        if i in a:
            cnt += 1
        else:
            tot += binom(n - i, k - cnt - 1)

    for i in range(~k & 1, n + 1, 2):
        if tot > binom(n, i):
            tot -= binom(n, i)
            continue
        cnt = 0
        b = []
        for j in range(1, n + 1):
            if tot > binom(n - j, i - cnt - 1):
                tot -= binom(n - j, i - cnt - 1)
                continue
            b.append(j)
            cnt += 1
        break
    print(n, len(b))
    print(" ".join(list(map(str, b))))    

T = int(input())
print(T)
for _ in range(T):
    solve()