import numpy as np

def choose(day, price, pies, S):
    pies.append()
    for i in len(S[day]):
        if S[day][i] == price:
            del S[day][i]
            return

def findBest(pies, S):

def solve(N, M, S):
    print("N={0}, M={1}".format(N, M))
    print(S)

    pies = []
    # First day: chose the cheapest
    pies[0] = min(S[0])
    

    # Next days
    for i in range(1, M):
        day, price = findBest(pies, S)
        

    return 'white'

if __name__ == "__main__":
    import fileinput
    f = fileinput.input()

    T = int(f.readline())
    for case in range(1, T+1):
        N, M = [int(i) for i in f.readline().split()]
        S = [[int(i) for i in f.readline().split()] for x in range(N)]
        solution = solve(N, M, S)
        print("Case #{0}: {1}".format(case, solution))