from collections import Counter

def displayable(xs, k):
    kmin = kmax = k
    for c in Counter(xs).values():
        if c > 2:
            return False
        if c == 2:
            kmin -= 1
            kmax -= 1
        elif c == 1:
            kmax -= 1
            kmin, kmax = sorted([kmin, kmax])
    return all(v >= 0 for v in [kmin, kmax])

for t in range(int(input())):
    n, k = [int(x) for x in input().split()]
    xs = [int(x) for x in input().split()]
    answer = ['NO','YES'][displayable(xs, k)]
    print(f'Case #{t+1}: {answer}')

DIRS = [(0, +1), (+1, 0), (0, -1), (-1, 0)]

def pairs(r, c):
    return ((i, j) for i in range(r) for j in range(c))

def get_happy(r, c, grid):
    def vaild_cell(i, j):
        return 0 <= i < r and 0 <= j < c and grid[i][j] != '#'
    def neighbors(i, j):
        return ((i+dy, j+dx) for dy, dx in DIRS if vaild_cell(i+dy, j+dx))
    def count(i, j):
        return sum(fill[y][x] == '^' for y, x in neighbors(i, j))
    fill = [['^#'[cell == '#'] for cell in row] for row in grid]
    bans = {(i, j) for i, j in pairs(r, c) if count(i, j) < 2}
    while bans:
        i, j = bans.pop()
        if grid[i][j] == '#':
            continue
        fill[i][j] = '.'
        for y, x in neighbors(i, j):
            if fill[y][x] == '^' and count(y, x) < 2:
                bans.add((y, x))
    if not all(fill[i][j] == '^' for i, j in pairs(r, c) if grid[i][j] == '^'):
        return []
    return fill

for t in range(int(input())):
    r, c = [int(v) for v in input().split()]
    grid = get_happy(r, c, [list(input().strip()) for _ in range(r)])
    answer = ['Impossible','Possible'][bool(grid)]
    print(f'Case #{t+1}: {answer}')
    for line in grid:
        print(''.join(line))

def binary_to_dashed_dotted(number):
    return ''.join('.-'[int(c)] for c in f'{number:08b}')

def eight_dashed_dotted():
    return [binary_to_dashed_dotted(i) for i in range(2**8)]

def valid_remaining_alphabets(word):
    return [w for w in eight_dashed_dotted() if not w.startswith(word[:8])]

for t in range(int(input())):
    n = int(input())
    answer = valid_remaining_alphabets(input().strip())
    print(f'Case #{t+1}:')
    for alphabet in answer[:n-1]:
        print(alphabet)